Action-Minimization Meets Generative Modeling: Efficient Transition Path Sampling with the Onsager-Machlup Functional
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:SNTEYFD7record.jsonopen to challenge →
read the original 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 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 approaches 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. Code is available at github.com/ASK-Berkeley/OM-TPS.
This paper has not been read by Pith yet.
Forward citations
Cited by 9 Pith papers
-
A Priori Sampling of Transition States with Guided Diffusion
ASTRA reframes transition-state search as guided diffusion inference that samples the isodensity surface between metastable basins and converges to first-order saddles via score differences and physical forces.
-
Onsager-Machlup Posterior Transport for Deep Gaussian Processes
OM-Path uses Onsager-Machlup-regularized posterior transport on Doob-bridged paths for DGP inference and reports statistical wins over DBVI on the two largest UCI regression benchmarks.
-
A Call to Lagrangian Action: Learning Population Mechanics from Temporal Snapshots
Wasserstein Lagrangian Mechanics learns second-order population dynamics from observed marginals without specifying the Lagrangian and outperforms gradient flow methods on periodic dynamics like vortex motion and flocking.
-
A Call to Lagrangian Action: Learning Population Mechanics from Temporal Snapshots
Wasserstein Lagrangian Mechanics formalizes second-order dynamics in Wasserstein space and provides an algorithm to learn them from observed marginals without specifying the Lagrangian, outperforming gradient flows on...
-
A Call to Lagrangian Action: Learning Population Mechanics from Temporal Snapshots
Wasserstein Lagrangian Mechanics learns second-order population dynamics from observed marginal snapshots without specifying the Lagrangian and outperforms gradient flow methods on tasks like vortex dynamics and embry...
-
Onsager-Machlup Posterior Transport for Deep Gaussian Processes
OM-Path frames DGP inference as learning a deterministic transport map from reference to posterior inducing variables using probability-flow ODE on Doob-bridged SDE with Onsager-Machlup path regularization, yielding s...
-
Drift-React: One-step Generation of Reaction Pathways via SE(3) Drifting Fields
Drift-React produces full minimum energy pathways for reactions in a single step via SE(3) drifting fields, matching TS accuracy of iterative models with orders-of-magnitude speedup on Transition1x and Halo8 datasets.
-
Information as Maximum-Caliber Deviation: A bridge between Integrated Information Theory and the Free Energy Principle
Information defined as maximum-caliber deviation derives IIT 3.0 cause-effect repertoires from constrained entropy maximization and equates to prediction error under CLT and LDT.
-
Energy-oriented Diffusion Bridge for Image Restoration with Foundational Diffusion Models
E-Bridge approximates low-cost geodesic trajectories in diffusion bridges for image restoration by using shorter time horizons, entropy-regularized starts mixing degraded images with noise, and consistency-model singl...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.