Rare events such as conformational changes in biomolecules, phase transitions, and chemical reactions are central to the behavior of many physical systems, yet they are extremely difficult to study computationally because unbiased simulations seldom produce them. Transition Path Theory (TPT) provides a rigorous statistical framework for analyzing such events: it characterizes the ensemble of reactive trajectories between two designated metastable states (reactant and product), and its central object--the committor function, which gives the probability that the system will next reach the product rather than the reactant--encodes all essential kinetic and thermodynamic information. We introduce a framework that casts committor estimation as a stochastic optimal control (SOC) problem. In this formulation the committor defines a feedback control--proportional to the gradient of its logarithm--that actively steers trajectories toward the reactive region, thereby enabling efficient sampling of reactive paths. To solve the resulting hitting-time control problem we develop two complementary objectives: a direct backpropagation loss and a principled off-policy Value Matching loss, for which we establish first-order optimality guarantees. We further address metastability, which can trap controlled trajectories in intermediate basins, by introducing an alternative sampling process that preserves the reactive current while lowering effective energy barriers. On benchmark systems, the framework yields markedly more accurate committor estimates, reaction rates, and equilibrium constants than existing methods.
Figures & tables
Figure 1: Rugged Müller–Brown results, shown as the most metastable overdamped benchmark. Red curves in (a) mark the finite-element q=0.5 transition surface; black curves mark the learned q=0.5 surface. Panels (b,c) compare transition-path ensembles sampled by TPS and by the learned REACT-VM control, while panels (d,e) compare the corresponding hitting-time distributions. Full overdamped committor, path, and flux are shown in Figures 6 , 7 and 8 .
Figure 2Figure 3Figure 4
Figure 5: Ground-truth and learned committors on the periodically-driven triple-well system, overlaid with the time-dependent force field of the system.
Appendix figures & tables9 assets
Supplementary material from the paper’s appendix.
Appendix
Hyperparameter
Triple-well
Müller
Rugged Müller
Model
Network architecture
MLP
Network size
(32, 64, 128, 64, 32)
Training
Learning rate
0.001
Training iterations
20,000
Appendix
Table 5: Hyperparameters for the overdamped Langevin system experiments.
Hyperparameter
Underdamped DW
Maier–Stein
Periodic TW
Model
Network architecture
MLP
Network size
(32, 64, 128, 64, 32)
Training
Learning rate
0.001
Training iterations
40,000
Appendix
Table 6: Hyperparameters for the underdamped and non-reversible experiments.
Figure 6: Ground-truth and learned committors on the three overdamped systems. Red curves mark the finite-element q=0.5 transition surface; black curves mark the q=0.5 surface learned by each method. All REACT-VM visualizations use κ=1.0 .
Figure 7: Transition-path ensembles and hitting-time distributions for TPS and REACT-VM on the three overdamped potentials. Two representative trajectories are highlighted in each path ensemble. REACT-VM results use κ=1.0 for all systems.
Figure 8: Reactive flux visualizations on the three overdamped potentials with κ=0 .
Figure 9: Mean absolute error maps between ground-truth and learned committor functions on the three overdamped systems.
Figure 10: Mean absolute error map between ground-truth and learned committor functions on the underdamped double-well system.
Figure 11: Mean absolute error map between ground-truth and learned committor functions on the Maier–Stein system.
Figure 12: Mean absolute error map between ground-truth and learned committor functions on the periodically-driven triple-well system.
Sampling transitions between metastable states is a central problem in dynamical systems theory and molecular dynamics in particular. A key challenge is the existence of high free-energy barriers that separate the states, making transitions extremely rare. Recent machine learning-based methods cast transition path sampling (TPS) as an optimal stochastic control (OSC) problem over a fixed time horizon, and parameterize the drift bias via a neural network trained by simulation-in-the-loop, requiring repeated biased rollouts. To address computational and performance guarantee issues of these models, we propose a new approach for the problem based on Koopman operators. Because Koopman operators are linear, their leading eigenfunctions reveal the metastable sets and provide an estimate of the committor function with no transition path information required. Furthermore, we formulate TPS as an OSC problem up to an exit time. Our time horizon is the first hitting time of the target set, and our running cost penalizes time spent in nonreactive regions by encoding the estimated committor function. We derive the optimal controller in closed form and approximate it in a reproducing kernel Hilbert space (RKHS). This reduces the problem of constructing the optimal controller to solving a single equality-constrained quadratic program, whose solution can be characterized by a linear Karush-Kuhn-Tucker (KKT) system. On the two-channel double well and alanine dipeptide, our controller increases the fraction of trajectories reaching the target from 0% to 99.8% within 1000 steps, and from 0% to 93% within 1ps, respectively.
Transition path sampling (TPS) aims to efficiently generate rare molecular transition trajectories between metastable states and is essential for understanding biomolecular mechanisms. Beyond traditional molecular dynamics (MD)-based sampling, machine learning has become central to state-of-the-art TPS. One major class of methods learns control forces during explicit MD rollouts. By preserving the underlying molecular dynamics, these methods tend to produce more physically plausible trajectories than endpoint-conditioned generators that construct paths directly. However, rollout-based control methods have been reported to exhibit unstable and strongly seed-dependent performance. We recast rollout-based control as learning a path-space proposal distribution and investigate stochasticity placement as a design choice for improving exploration and optimization robustness. We develop two stochastic policies: FS-TPS, which directly parameterizes a state-dependent Gaussian distribution over the control policy output, and LaS-TPS, which samples a compact latent control variable and decodes it into structured, cross-atom-correlated force variation. We conduct extensive multi-seed experiments on three biomolecular systems of increasing size: alanine dipeptide, chignolin, and BBL, a fast-folding protein. Stochastic policies consistently improve transition success and path quality over deterministic-policy baselines while substantially reducing sensitivity to random initialization.
Jingqian Liu, Yu-Hsiang Wang, Yanru Qu +1
Siebel School of Computing and Data Science, University of Illinois Urbana–Champaign · Department of Electrical and Computer Engineering, University of Illinois Urbana–Champaign
Path sampling methods generate ensembles of reactive trajectories connecting metastable states, but extracting mechanistic insight from these data remains nontrivial. We introduce Flux Matching, a framework that learns two complementary objects directly from reactive trajectory data: a current velocity u(z), whose streamlines trace the dominant reaction pathways, and a scalar potential h(z), obtained from a weighted Helmholtz-Hodge decomposition of the reactive current, that serves as a data-driven reaction coordinate. Both minimize quadratic functionals over the reactive path ensemble, analogous to the flow matching loss in generative modeling, and require no knowledge of the underlying dynamics or stationary distribution. Unlike committor-based methods, u and h remain well-defined under projection onto non-Markovian collective variables, and their level sets in turn provide adaptive interfaces for improved sampling with enhanced sampling methods. Flux Matching is validated through the generation of current velocity trajectories and rate constant calculations on molecular systems.
Rishal Aggarwal, David Ryan Koes, Nicholas M. Boffi +1
CMU-Pitt Program in Computational Biology Dept. of Computational & Systems Biology University of Pittsburgh · Machine Learning Department Dept. of Mathematical Sciences Carnegie Mellon University · Courant Institute, New York University Machine Learning Lab +1