arXiv Machine Learning

Data-driven Effective Modeling of Stochastic Chemical Reaction Networks

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.

arXiv Machine Learning
Sep 17

Machine learning kinetics from molecular dynamics data

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
arXiv AI
Jun 2

Strong Stochastic Flow Maps

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
arXiv Machine Learning
Sep 18

Correlation-Free Transition Path Sampling through Shooting Point Generation Guided by Committor Learning

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 Machine Learning
Jun 29

Reduction of Probabilistic Chemical Reaction Networks

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 Machine Learning
Jun 10

It\^o maps for any-step SDEs

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