Staying the course: Locating equilibria of dynamical systems on Riemannian manifolds defined by point-clouds
Not on the map. Why?
Abstract (arXiv)
We introduce a method to successively locate equilibria (steady states) of dynamical systems on Riemannian manifolds. The manifolds need not be characterized by an a priori known atlas or by the zeros of a smooth map. Instead, they can be defined by point-clouds and sampled as needed through an iterative process. If the manifold is an Euclidean space, our method follows isoclines, curves along which the direction of the vector field X is constant. For a generic vector field X, isoclines are smooth curves and every equilibrium lies on isoclines. We generalize the definition of isoclines to Riemannian manifolds through the use of parallel transport: generalized isoclines are curves along which the directions of X are parallel transports of each other. As in the Euclidean case, generalized isoclines of generic vector fields X are smooth curves that connect equilibria of X. Our algorithm can be regarded as an extension of the method of Newton trajectories to the manifold setting when the manifold is unknown. This work is motivated by computational statistical mechanics, specifically high dimensional (stochastic) differential equations that model the dynamics of molecular systems. Often, these dynamics concentrate near low-dimensional manifolds and have transitions (saddle points with a single unstable direction) between metastable equilibria. We employ iteratively sampled data and isoclines to locate these saddle points. Coupling a black-box sampling scheme (e.g., Markov chain Monte Carlo) with manifold learning techniques (diffusion maps in the case presented here), we show that our method reliably locates equilibria of X.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 88 references that are in the map. First posted on arXiv 21 Apr 2022.
Builds on
9 of 88 references.
References · 9
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2020Neural Manifold Ordinary Differential Equationscited by 81
- 2014On the saddle point problem for non-convex optimizationcited by 19
- 2014The Geometric Foundations of Hamiltonian Monte Carlocited by 19
- 2013Non-linear dimensionality reduction: Riemannian metric estimation and the problem of geometric discoverycited by 14
- 2019Nonlinear Discovery of Slow Molecular Modes using State-Free Reversible VAMPnetscited by 14
- 2019Learning Weighted Submanifolds with Variational Autoencoders and Riemannian Variational Autoencoderscited by 14
- 2020Molecular Latent Space Simulatorscited by 13
- 2016Convergence and Cycling in Walker-type Saddle Search Algorithmscited by 2
Built on by
Citing papers per year: 2023: 1.
1 paper.