Minimum energy path calculations with Gaussian process regression

Abstract

The calculation of minimum energy paths for transitions such as atomic and/or spin re-arrangements is an important task in many contexts and can often be used to determine the mechanism and rate of transitions. An important challenge is to reduce the computational effort in such calculations, especially when ab initio or electron density functional calculations are used to evaluate the energy since they can require large computational effort. Gaussian process regression is used here to reduce significantly the number of energy evaluations needed to find minimum energy paths of atomic rearrangements. By using results of previous calculations to construct an approximate energy surface and then converge to the minimum energy path on that surface in each Gaussian process iteration, the number of energy evaluations is reduced significantly as compared with regular nudged elastic band calculations. For a test problem involving rearrangements of a heptamer island on a crystal surface, the number of energy evaluations is reduced to less than a fifth. The scaling of the computational effort with the number of degrees of freedom as well as various possible further improvements to this approach are discussed.

References in corpus (4)

• Improved initial guess for minimum energy path calculations
• Global transition path search for dislocation formation in Ge on Si(001)
• Method for finding mechanism and activation energy of magnetic transitions, applied to skyrmion and antivortex annihilation
• Calculations of magnetic states and minimum energy paths of transitions using a noncollinear extension of the Alexander-Anderson model and a magnetic force theorem

Cited by in corpus (7)

• Gaussian Process Regression for Transition State Search
• Machine Learning and Data-Driven Methods in Computational Surface and Interface Science
• Twin Neural Network Regression
• Efficient Implementation of Gaussian Process Regression Accelerated Saddle Point Searches with Application to Molecular Reactions
• Discretization-free Knowledge Gradient Methods for Bayesian Optimization
• Correcting boundary over-exploration deficiencies in Bayesian optimization with virtual derivative sign observations
• Scalable Bayesian Optimization with Sparse Gaussian Process Models