arXiv Machine Learning By Yang-yang Tan, Jinyang Li, Lingxiao Wang

Generative Modeling of Stochastic Dynamics for Long-Time Evolution

Read the original on arXiv Machine Learning →

The paper demonstrates that long‑time stochastic dynamics can be predicted using generative diffusion models trained only on configuration pairs separated by a short, fixed time lag, without requiring the underlying equations of motion. Applied to two‑dimensional Model B and driven colloids in a periodic optical potential, the learned transition kernels accurately reproduce dynamic critical scaling, self‑similar coarsening, and experimental observables such as particle current and mean passage time, even on larger lattices and unseen initial conditions. This shows that short‑time observations contain sufficient information to forecast emergent non‑equilibrium behavior over extended periods.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

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 Machine Learning
Sep 15

Physics-Constrained Neural Surrogate for Domain Growth Prediction in Systems with Conserved Kinetics

The paper introduces a physics-constrained neural network surrogate that learns the microstructural evolution of binary mixtures governed by the Cahn‑Hilliard equation. By imposing conservation of the order parameter as a hard constraint on the network output, the model accurately predicts long‑time phase‑separation dynamics for both critical and off‑critical mixtures, maintaining mixture composition and matching the Lifshitz‑Slyozov domain‑growth law. A variant that enforces conservation only through a penalty term drifts from the initial composition and loses predictive accuracy over long rollouts, underscoring the necessity of the hard constraint for stability.

By Vijay Yadav, Pallvi Pandey, Madhu Priya, Manish Dev Shrimali, Prabhat K. Jaiswal