Action-Minimization Meets Generative Modeling: Efficient Transition Path Sampling with the Onsager-Machlup Functional
Sanjeev Raja, Martin Sípka, Michael Psenka, Tobias Kreiman, Michal Pavelka, Aditi S. Krishnapriyan
Abstract
Transition path sampling (TPS), which involves finding probable paths connecting two points on an energy landscape, remains a challenge due to the complexity of real-world atomistic systems. Current machine learning approaches use expensive, task-specific, and data-free training procedures, limiting their ability to benefit from recent advances in atomistic machine learning, such as high-quality datasets and large-scale pre-trained models. In this work, we address TPS by interpreting candidate paths as trajectories sampled from stochastic dynamics induced by the learned score function of pre-trained generative models, specifically denoising diffusion and flow matching. Under these dynamics, finding high-likelihood transition paths becomes equivalent to minimizing the Onsager-Machlup (OM) action functional. This enables us to repurpose pre-trained generative models for TPS in a zero-shot manner, in contrast with bespoke, task-specific TPS models trained in previous work. We demonstrate our approach on varied molecular systems, obtaining diverse, physically realistic transition pathways and generalizing beyond the pre-trained model's original training dataset. Our method can be easily incorporated into new generative models, making it practically relevant as models continue to scale and improve with increased data availability.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a0536d5a-2e24-4cf1-9192-ad1baae729d1Cited by top-tier papers10
- Flow Matching Policy GradientsDavid McAllister, Songwei Ge, Brent Yi, Chung Min Kim et al.ICLR 2026 · 103 citations
- Consistent Sampling and Simulation: Molecular Dynamics with Energy-Based Diffusion ModelsMichael Plainer, Hao Wu, Leon Klein, Stephan Günnemann et al.NeurIPS 2025 · 34 citations
- Enhancing Diffusion-Based Sampling with Molecular Collective VariablesJuno Nam, Bálint Máté, Artur P. Toshev, Manasa Kaniselvan et al.ICLR 2026 · 15 citations
- When Scores Learn Geometry: Rate Separations under the Manifold HypothesisXiang Li, Zebang Shen, Ya-Ping Hsieh, Niao HeICLR 2026 · 10 citations
- The Spacetime of Diffusion Models: An Information Geometry PerspectiveRafal Karczewski, Markus Heinonen, Alison Pouplin, Søren Hauberg et al.ICLR 2026 · 7 citations
Builds on12
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 35,902 citations
- Crystal Diffusion Variational Autoencoder for Periodic Material GenerationTian Xie, Xiang Fu, Octavian-Eugen Ganea, Regina Barzilay et al.ICLR 2022 · 394 citations
- AlphaFold Meets Flow Matching for Generating Protein EnsemblesBowen Jing, Bonnie Berger, Tommi S. JaakkolaICML 2024 · 229 citations
- Generative Modeling of Molecular Dynamics TrajectoriesBowen Jing, Hannes Stärk, Tommi S. Jaakkola, Bonnie BergerNeurIPS 2024 · 97 citations
- Flow Matching for Generative ModelingYaron Lipman, Ricky T. Q. Chen, Heli Ben-Hamu, Maximilian Nickel et al.ICLR 2023 · 87 citations
Related papers
- Transition Path Sampling with Improved Off-Policy Training of Diffusion Path SamplersKiyoung Seong, Seonghyun Park, Seonghwan Kim, Woo Youn Kim et al.ICLR 2025
- Transferable Boltzmann GeneratorsLeon Klein, Frank NoéNeurIPS 2024 · 64 citations
- Variational Flow Matching for Graph GenerationFloor Eijkelboom, Grigory Bartosh, Christian Andersson Naesseth, Max Welling et al.NeurIPS 2024 · 96 citations
- Flow Sampling : Learning to Sample from Unnormalized Densities via Denoising Conditional ProcessesAaron Havens, Brian Karrer, Neta ShaulICML 2026 · 2 citations
- Path Gradients after Flow MatchingLorenz Vaitl, Leon KleinNeurIPS 2025 · 3 citations
