The article reviews modern machine learning techniques for estimating the committor and related kinetic statistics from molecular dynamics simulations. It emphasizes self‑supervised methods that solve the underlying dynamical equations instead of relying on labeled data, and unifies various approaches—generator‑based PDEs, variational principles, Markov state models, dynamical Galerkin approximation, and neural networks—under a common operator framework. The review also discusses practical guidance for handling non‑Markovian effects, sampling strategies, and outlines future research directions such as connections to reinforcement learning and generative modeling.
By Jonathan Weare, Aaron R. Dinner
Simulation-based Bayesian inference for Chemical Reaction Networks (CRNs) must simultaneously solve two computationally demanding problems: discriminating between overlapping reaction pathways and est...
arXiv:2512.10309v3 Announce Type: replace-cross
Abstract: Chemical reaction networks are widely used to model stochastic dynamics in biophysical processes. Their exact probabilistic description via t...
By Jiayu Weng, Xinyi Zhu, Jing Liu, Linyuan L\"u, Pan Zhang, Ying Tang
arXiv:2606. 01086v1 Announce Type: cross Abstract: Flow and diffusion models generate high-quality samples in many modalities; however, many network evaluations are required during inference due to numerical integration of an underlying differential equation.
By Sam McCallum, Zander W. Blasingame, Timothy Herschell, Niklas Rindtorff, Alexander Tong, James Foster
Studying the dynamical behavior of a system often depends on characterizing how it transitions between long-lived states. Because such transitions are rare, observing them usually requires specialized...
The paper introduces GenAIMMD, an iterative algorithm that learns the committor function and trains a conditioned Boltzmann Generator to generate uncorrelated transition paths without prior knowledge of the reaction coordinate. This method combines transition path sampling with committor learning, enabling fully parallelizable sampling. Benchmarks on a toy model and a polymer system show a substantial performance improvement over standard TPS.
By Maximilian Negedly, Sebastian Falkner, Alessandro Coretti, Christoph Dellago
arXiv:2606. 27737v1 Announce Type: new Abstract: Programming adaptive behaviors at the cellular level is a long-standing goal that raises the question of how probabilistic computation can be implemented in biochemical systems.
By Mauricio Montes, Gregoire Sergeant-Perthuis
arXiv:2606. 11156v1 Announce Type: cross Abstract: Recent one-step generative models accelerate sampling by learning deterministic flow maps of the underlying dynamics.
By Zhengkai Pan, Peter Potaptchik, Wenxi Yao, Michael S. Albergo, Jakiw Pidstrigach
arXiv:2608.25631v1 Announce Type: cross
Abstract: Continuous-time Markov chains (CTMCs) provide the backbone for modeling discrete stochastic dynamics across applied, physical, and biological science...
By Jose M. G. Vilar, Leonor Saiz
arXiv:2608. 07648v1 Announce Type: cross Abstract: Sampling high-dimensional probability distributions is a central task in scientific computing, with applications ranging from Bayesian inference to statistical physics and molecular simulation.
By Marylou Gabri\'e
arXiv:2606. 09434v1 Announce Type: new Abstract: The Fokker-Planck equation (FPE) plays a pivotal role in describing the time evolution of probability density functions (PDFs) for systems governed by stochastic dynamics.
By Li Zeng, Xiaoliang Wan, Yaobin Wang, Fabio Nobile, Tao Zhou
arXiv:2606. 15793v1 Announce Type: cross Abstract: This paper explores policy gradient algorithms for training stochastic policies to sample from structured discrete probability distributions under the Generative Flow Network (GFlowNet) framework.
By Anna Zykova-Myzina, Timofei Gritsaev, Daniil Tiapkin, Nikita Morozov