arXiv:2604. 13213v2 Announce Type: replace-cross Abstract: 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.
arXiv:2608. 13800v1 Announce Type: new Abstract: Transition path sampling (TPS) aims to efficiently generate rare molecular transition trajectories between metastable states and is essential for understanding biomolecular mechanisms.
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...
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.
arXiv:2604. 02121v2 Announce Type: replace-cross Abstract: Stochastic kinetic models are ubiquitous in physics, yet inferring their parameters from experimental data remains challenging.
arXiv:2604. 08580v2 Announce Type: replace-cross Abstract: Reward fine-tuning of diffusion and flow models and sampling from tilted or Boltzmann distributions can both be formulated as stochastic optimal control (SOC) problems, where learning an optimal generative dynamics corresponds to optimizing a control under SDE constraints.
arXiv:2606. 06295v1 Announce Type: new Abstract: Path sampling methods generate ensembles of reactive trajectories connecting metastable states, but extracting mechanistic insight from these data remains nontrivial.
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.
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.
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...
arXiv:2602. 16634v2 Announce Type: replace-cross Abstract: The rare-event sampling problem has long been the central limiting factor in molecular dynamics (MD), especially in biomolecular simulation.
arXiv:2606. 30687v1 Announce Type: cross Abstract: Diffusion models are increasingly utilized for modeling molecular structures and conformational ensembles, yet the thermodynamic meaning of their learned representations and scores remains elusive.
The paper introduces a data-driven effective model for stochastic chemical reaction networks that bypasses the high computational cost of the Stochastic Simulation Algorithm (SSA). By approximating the finite-time transition kernel of the SSA-induced continuous-time Markov chain with a generative machine learning model, the method operates on a user-defined coarse time step independent of microscopic reaction events. Using a conditional normalizing flow as the stochastic propagator, the trained model recursively generates statistically consistent trajectories, achieving significant computational savings while maintaining accuracy, as demonstrated through numerous numerical examples.