Using Witten Laplacians to locate index-1 saddle points
Preprint
Abstract
We introduce a new stochastic algorithm to locate the index-1 saddle points of a function $V:\mathbb R^d \to \mathbb R$, with $d$ possibly large. This algorithm can be seen as an equivalent of the stochastic gradient descent which is a natural stochastic process to locate local minima. It relies on two ingredients: (i) the concentration properties on index-1 saddle points of the first eigenmodes of the Witten Laplacian (associated with $V$) on $1$-forms and (ii) a probabilistic representation of a partial differential equation involving this differential operator. Numerical examples on simple molecular systems illustrate the efficacy of the proposed approach.
Keywords
All Related Versions
This publication has 43 references indexed in Scilit:
- Stability of the minimum energy pathNumerische Mathematik, 2024
- Switched diffusion processes for non-convex optimization and saddle points searchStatistics and Computing, 2023
- An Introduction to Sequential Monte Carlo2020
- Modeling Aggregation Processes of Lennard-Jones particles Via Stochastic NetworksJournal of Statistical Physics, 2017
- Enclosure of all index-1 saddle points of general nonlinear functionsJournal of Global Optimization, 2016
- Precise Arrhenius Law for p-forms: The Witten Laplacian and Morse–Barannikov ComplexAnnales Henri Poincare, 2012
- An theory for differential forms on path spaces IJournal of Functional Analysis, 2008
- The activation–relaxation technique: an efficient algorithm for sampling energy landscapesComputational Materials Science, 2001
- A simulated annealing based technique for locating first-order saddle points on multidimensional surfaces and constructing reaction paths: several model studiesJournal of Molecular Structure: THEOCHEM, 1998
- Formulae for the Derivatives of Heat SemigroupsJournal of Functional Analysis, 1994