用高斯过程加速分子反应鞍点搜索,大幅减少计算量。
Efficient Implementation of Gaussian Process Regression Accelerated Saddle Point Searches with Application to Molecular Reactions
- 用高斯过程构建能量代理模型,动态更新以指导搜索
- 相比传统二体法减少约90%电子结构计算次数
- 适合需频繁找鞍点的分子反应动力学研究
在谐振近似下,寻找高维势能面上的一阶鞍点是确定热激活事件机理与速率的关键。直接结合电子结构计算时,能量和原子力评估次数成为主要瓶颈。本文描述了一种高效实现的高斯过程回归(GPR)加速最小模态跟随方法,其中使用二体法估计海森矩阵最低特征模态。每次电子结构计算后更新代理能量面。该方法应用于赫梅兹等人之前生成的500个分子反应测试集。与二体法相比,使用GPR可将收敛至鞍点所需的电子结构计算次数降低一个数量级。尽管分子自由度刚度差异大,仍采用笛卡尔坐标进行计算,所需计算次数与Sella软件包中的复杂内坐标方法相当。本研究在C++中实现的GPR代理模型足够高效,在4次计算中有3次使鞍点搜索的耗时显著减少,即使计算在低哈特里-福克水平下进行。
原文摘要 · Abstract (English)
The task of locating first order saddle points on high-dimensional surfaces describing the variation of energy as a function of atomic coordinates is an essential step for identifying the mechanism and estimating the rate of thermally activated events within the harmonic approximation of transition state theory. When combined directly with electronic structure calculations, the number of energy and atomic force evaluations needed for convergence is a primary issue. Here, we describe an efficient implementation of Gaussian process regression (GPR) acceleration of the minimum mode following method where a dimer is used to estimate the lowest eigenmode of the Hessian. A surrogate energy surface is constructed and updated after each electronic structure calculation. The method is applied to a test set of 500 molecular reactions previously generated by Hermez and coworkers [J. Chem. Theory Comput. 18, 6974 (2022)]. An order of magnitude reduction in the number of electronic structure calculations needed to reach the saddle point configurations is obtained by using the GPR compared to the dimer method. Despite the wide range in stiffness of the molecular degrees of freedom, the calculations are carried out using Cartesian coordinates and are found to require similar number of electronic structure calculations as an elaborate internal coordinate method implemented in the Sella software package. The present implementation of the GPR surrogate model in C++ is efficient enough for the wall time of the saddle point searches to be reduced in 3 out of 4 cases even though the calculations are carried out at a low Hartree-Fock level.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。