Active Learning for Saddle Point Calculation
Not on the map. Why?
Abstract (arXiv)
The saddle point (SP) calculation is a grand challenge for computationally intensive energy function in computational chemistry area, where the saddle point may represent the transition state (TS). The traditional methods need to evaluate the gradients of the energy function at a very large number of locations. To reduce the number of expensive computations of the true gradients, we propose an active learning framework consisting of a statistical surrogate model, Gaussian process regression (GPR) for the energy function, and a single-walker dynamics method, gentle accent dynamics (GAD), for the saddle-type transition states. SP is detected by the GAD applied to the GPR surrogate for the gradient vector and the Hessian matrix. Our key ingredient for efficiency improvements is an active learning method which sequentially designs the most informative locations and takes evaluations of the original model at these locations to train GPR. We formulate this active learning task as the optimal experimental design problem and propose a very efficient sample-based sub-optimal criterion to construct the optimal locations. We show that the new method significantly decreases the required number of energy or force evaluations of the original model.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 49 references that are in the map. First posted on arXiv 10 Aug 2021.
Builds on
5 of 49 references.
References · 5
- 2018Less is more: sampling chemical space with active learningcited by 80
- 2018Active Learning of Uniformly Accurate Inter-atomic Potentials for Materials Simulationcited by 37
- 2019Computing Committor Functions for the Study of Rare Events Using Deep Learningcited by 29
- 2017Nudged elastic band calculations accelerated with Gaussian process regressioncited by 7
- 2017Reinforced dynamics for enhanced sampling in large atomic and molecular systemscited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 1.
2 papers.