EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Adaptive Pruning for Increased Robustness and Reduced Computational Overhead in Gaussian Process Accelerated Saddle Point Searches

Rohit Goswami iD, Hannes Jónsson iD

ChemPhysChem · 25.02.2026 · 27 (4)

DOI: 10.1002/cphc.202500730 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ChemPhysChem, online erschienen am 23.02.2026. Verfasst von Rohit Goswami und 1 weiteren Autor:innen. Beteiligte Einrichtung: Institute IMX and Lab-COSMO, École polytechnique fédérale de Lausanne (EPFL), Lausanne, Switzerland. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 62 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Rannís.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Gaussian process (GP) regression provides a strategy for accelerating saddle point searches on high‐dimensional energy surfaces by reducing the number of times the energy and its derivatives with respect to atomic coordinates need to be evaluated. The computational overhead in the hyperparameter optimization can, however, be large and make the approach inefficient. Failures can also occur if the search ventures too far into regions that are not represented well enough by the GP model. Here, these challenges are resolved by using geometry‐aware optimal transport measures and an active pruning strategy using a summation over Wasserstein‐1 distances for each atom‐type in farthest‐point sampling, selecting a fixed‐size subset of geometrically diverse configurations to avoid rapidly increasing cost of GP updates as more observations are made. Stability is enhanced by a permutation‐invariant metric that provides a reliable trust radius for early‐stopping and a logarithmic barrier penalty for the growth of the signal variance. These physically motivated algorithmic changes prove their efficacy by reducing to less than a half the mean computational time on a set of 238 challenging configurations from a previously published data set of chemical reactions. With these improvements, the GP approach is established as a robust and scalable algorithm for accelerating saddle point searches when the evaluation of the energy and atomic forces requires significant computational effort.

Schlagwörter

Stichwörter der Autor:innen

Gaussian process regressioncomputational chemistrydata pruningdimer methodoptimal transportsaddle point search

Autor:innen und Institutionen

  • Institute IMX and Lab-COSMO, École polytechnique fédérale de Lausanne (EPFL), Lausanne, Switzerland.
  • Science Institute and Faculty of Physical Sciences, University of Iceland, Reykjavík, Iceland.

ORCID-Profile: Rohit Goswami, Hannes Jónsson

Förderung

  • Rannís

Zitieren

APA

Goswami, R., & Jónsson, H. (2026). Adaptive Pruning for Increased Robustness and Reduced Computational Overhead in Gaussian Process Accelerated Saddle Point Searches. ChemPhysChem, 27(4). https://doi.org/10.1002/cphc.202500730

Vancouver

Goswami R, Jónsson H. Adaptive Pruning for Increased Robustness and Reduced Computational Overhead in Gaussian Process Accelerated Saddle Point Searches. ChemPhysChem. 2026;27(4). doi:10.1002/cphc.202500730

BibTeX
@article{Goswami2026,
  author = {Goswami, Rohit and Jónsson, Hannes},
  title = {Adaptive Pruning for Increased Robustness and Reduced Computational Overhead in Gaussian Process Accelerated Saddle Point Searches},
  journal = {ChemPhysChem},
  year = {2026},
  volume = {27},
  number = {4},
  doi = {10.1002/cphc.202500730}
}
Kostenlos starten →