arXiv Machine Learning

Learning Hamiltonian Flow Maps: Mean Flow Consistency for Large-Timestep Molecular Dynamics

arXiv:2601. 22123v4 Announce Type: replace Abstract: Simulating the long-time evolution of Hamiltonian systems is limited by the small timesteps required for stable numerical integration.

arXiv Machine Learning
Jul 10

Neural non-canonical Hamiltonian dynamics for long-time simulations

arXiv:2510. 01788v2 Announce Type: replace Abstract: This work focuses on learning non-canonical Hamiltonian dynamics from data, where long-term predictions require the preservation of structure both in the learned model and in numerical schemes.

By Cl\'ementine Court\`es (IRMA, MACARON), Emmanuel Franck (MACARON), Michael Kraus (IPP), Laurent Navoret (IRMA, MACARON), L\'eopold Tr\'emant (LML)
arXiv Machine Learning
Sep 4

Data-efficient Kernel Methods for Learning Hamiltonian Systems

The paper introduces kernel-based methods for learning Hamiltonian systems directly from trajectory data, offering both a 2‑step approach (reconstruct trajectories first, then learn the Hamiltonian) and a 1‑step approach (joint inference). Experiments on mass‑spring dynamics, a nonlinear pendulum, and the Henon‑Heiles system show that the methods achieve accurate, data‑efficient predictions, outperforming 2‑step baselines especially when data are scarce, while preserving the Hamiltonian structure. The authors also provide a priori error estimates and a general numerical framework applicable to arbitrary dynamical systems.

By Yasamin Jalalian, Mostafa Samir, Boumediene Hamzi, Peyman Tavallali, Houman Owhadi
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
Sep 17

Walking the Score Manifold: Continuous-time Generative Dynamics on Learned Data Manifolds

The paper proposes a continuous‑time generative framework that models time‑dependent data as evolution on a learned data manifold. By using pretrained score‑based models as geometric priors, it learns a vector field that drives data along score‑induced interpolation paths, enabling generation at arbitrary timestamps and temporal super‑resolution. The method includes a regression‑based training objective, a stability‑promoting term interpreted as denoising score matching, and a probabilistic extension for future trajectory distributions, demonstrated on natural video, PDE‑based fields, and molecular dynamics.

By Jan Tauberschmidt, Brian B. Moser, Stanislav Frolov, Andreas Dengel, Andrew B. Duncan, Sebastian J. Vollmer
arXiv Machine Learning
Jun 26

Symplectic Neural Networks for learning Generalized Hamiltonians

arXiv:2606. 27029v1 Announce Type: new Abstract: Hamiltonian Neural Networks (HNNs) integrate physical priors into neural models by learning a system's Hamiltonian, improving generalization and sample efficiency.

By Harsh Choudhary, Vyacheslav Kungurtsev, Chandan Gupta, Melvin Leok, Georgios Korpas