The high-index saddle dynamics (HiSD) method provides a powerful framework for finding saddle points and constructing solution landscapes. While originally derived for nondegenerate critical points, HiSD has demonstrated empirical success in degenerate cases, where the Hessian matrix exhibits zero eigenvalues. However, the mathematical and numerical analysis of HiSD for degenerate saddle points remains unexplored. In this paper, utilizing Morse-Bott functions, we present a rigorous analysis of HiSD for computing degenerate saddle points on a critical manifold. We prove the local convergence of the continuous HiSD and establish the linear convergence rate of the discrete HiSD algorithm. Furthermore, we provide a theoretical explanation for the gradient alignment tendency, revealing that the gradient direction asymptotically aligns with a specific Hessian eigenvector. Our analysis also elucidates the flexibility in selecting the index for HiSD in the context of degenerate saddle points. We validate our analytical results through numerical experiments on neural-network loss landscapes and demonstrate that momentum-accelerated variants of HiSD achieve rapid convergence to degenerate saddle points.
Saddle dynamics is a time continuous dynamics to efficiently compute the any-index saddle points and construct the solution landscape. In practice, the saddle dynamics needs to be discretized for numerical computations, while the corresponding numerical analysis are rarely studied in the literature, especially for the high-index cases. In this paper we propose the convergence analysis of discrete high-index saddle dynamics. To be specific, we prove the local linear convergence rates of numerical schemes of high-index saddle dynamics, which indicates that the local curvature in the neighborhood…
We develop and analyze numerical discretization to the constrained high-index saddle dynamics, the dynamics searching for the high-index saddle points confined on the high-dimensional unit sphere. Compared with the saddle dynamics without constraints, the constrained high-index saddle dynamics has more complex dynamical forms, and additional operations such as the retraction and vector transport are required due to the constraint, which significantly complicate the numerical scheme and the corresponding numerical analysis. Furthermore, as the existing numerical analysis results usually depend …
High-index saddle dynamics provides an effective means to compute the any-index saddle points and construct the solution landscape. In this paper we prove error estimates for Euler discretization of high-index saddle dynamics with respect to the time step size, which remains untreated in the literature. We overcome the main difficulties that lie in the strong nonlinearity of the saddle dynamics and the orthonormalization procedure in the numerical scheme that is uncommon in standard discretization of differential equations. The derived methods are further extended to study the generalized high…
We propose a model-free shrinking-dimer saddle dynamics for finding any-index saddle points and constructing the solution landscapes, in which the force in the standard saddle dynamics is replaced by a surrogate model trained by the Gassian process learning. By this means, the exact form of the model is no longer necessary such that the saddle dynamics could be implemented based only on some observations of the force. This data-driven approach not only avoids the modeling procedure that could be difficult or inaccurate, but also significantly reduces the number of queries of the force that may…
We present a mathematical and numerical investigation to the shrinkingdimer saddle dynamics for finding any-index saddle points in the solution landscape. Due to the dimer approximation of Hessian in saddle dynamics, the local Lipschitz assumptions and the strong nonlinearity for the saddle dynamics, it remains challenges for delicate analysis, such as the the boundedness of the solutions and the dimer error. We address these issues to bound the solutions under proper relaxation parameters, based on which we prove the error estimates for numerical discretization to the shrinking-dimer saddle d…
To find consistent initial data points for a system of differential-algebraic equations, requires the identification of its missing constraints. An efficient class of structural methods exploiting a dependency graph for this task was initiated by Pantiledes. More complete methods rely on differential-algebraic geometry but suffer from other issues (e.g. high complexity). In this paper we give a new class of efficient structural methods combined with new tools from numerical real algebraic geometry that has much improved completeness properties. Existing structural methods may fail for a system…
