mlsanityData to 7 Oct 2026

Supervised Learning and the Finite-Temperature String Method for Computing Committor Functions and Reaction Rates

arXiv 2107.13522 ↗First posted 28 Jul 2021cond-mat.stat-mech cs.LG physics.chem-phcited by 5

Not on the map. Why?

Abstract (arXiv)

A central object in the computational studies of rare events is the committor function. Though costly to compute, the committor function encodes complete mechanistic information of the processes involving rare events, including reaction rates and transition-state ensembles. Under the framework of transition path theory (TPT), recent work [1] proposes an algorithm where a feedback loop couples a neural network that models the committor function with importance sampling, mainly umbrella sampling, which collects data needed for adaptive training. In this work, we show additional modifications are needed to improve the accuracy of the algorithm. The first modification adds elements of supervised learning, which allows the neural network to improve its prediction by fitting to sample-mean estimates of committor values obtained from short molecular dynamics trajectories. The second modification replaces the committor-based umbrella sampling with the finite-temperature string (FTS) method, which enables homogeneous sampling in regions where transition pathways are located. We test our modifications on low-dimensional systems with non-convex potential energy where reference solutions can be found via analytical or the finite element methods, and show how combining supervised learning and the FTS method yields accurate computation of committor functions and reaction rates. We also provide an error analysis for algorithms that use the FTS method, using which reaction rates can be accurately estimated during training with a small number of samples. The methods are then applied to a molecular system in which no reference solution is known, where accurate computations of committor functions and reaction rates can still be obtained.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 7 of its 72 references that are in the map. First posted on arXiv 28 Jul 2021.

Builds on

7 of 72 references.

References · 7

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  4. 2021E(3)-Equivariant Graph Neural Networks for Data-Efficient and Accurate Interatomic Potentialscited by 701
  5. 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
  6. 2018Solving for high dimensional committor functions using artificial neural networkscited by 34
  7. 2019Computing Committor Functions for the Study of Rare Events Using Deep Learningcited by 29

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 1.

5 papers.