Transition Path Sampling with Improved Off-Policy Training of Diffusion Path Samplers
- URL: http://arxiv.org/abs/2405.19961v4
- Date: Mon, 07 Oct 2024 14:54:18 GMT
- Title: Transition Path Sampling with Improved Off-Policy Training of Diffusion Path Samplers
- Authors: Kiyoung Seong, Seonghyun Park, Seonghwan Kim, Woo Youn Kim, Sungsoo Ahn,
- Abstract summary: We introduce a novel approach that trains diffusion path samplers for transition path sampling.
We recast the problem as an amortized sampling of the target path measure.
We evaluate our approach, coined TPS-DPS, on a synthetic double-well potential and three peptides.
- Score: 10.210248065533133
- License:
- Abstract: Understanding transition pathways between meta-stable states in molecular systems is crucial to advance material design and drug discovery. However, unbiased molecular dynamics simulations are computationally infeasible due to the high energy barriers separating these states. Although recent machine learning techniques offer potential solutions, they are often limited to simple systems or rely on collective variables (CVs) derived from costly domain expertise. In this paper, we introduce a novel approach that trains diffusion path samplers (DPS) for transition path sampling (TPS) without the need for CVs. We recast the problem as an amortized sampling of the target path measure, minimizing the log-variance divergence between the path measure induced by our DPS and the target path measure. To ensure scalability for high-dimensional tasks, we introduce (1) a new off-policy training objective based on learning control variates with replay buffers and (2) a scale-based equivariant parameterization of the bias forces. We evaluate our approach, coined TPS-DPS, on a synthetic double-well potential and three peptides: Alanine Dipeptide, Polyproline Helix, and Chignolin. Results show that our approach produces more realistic and diverse transition pathways compared to existing baselines.
Related papers
- Generalized Flow Matching for Transition Dynamics Modeling [14.76793118877456]
We propose a data-driven approach to warm-up the simulation by learning nonlinearities from local dynamics.
Specifically, we infer a potential energy function from local dynamics data to find plausible paths between two metastable states.
We validate the effectiveness of the proposed method to sample probable paths on both synthetic and real-world molecular systems.
arXiv Detail & Related papers (2024-10-19T15:03:39Z) - Dynamical Measure Transport and Neural PDE Solvers for Sampling [77.38204731939273]
We tackle the task of sampling from a probability density as transporting a tractable density function to the target.
We employ physics-informed neural networks (PINNs) to approximate the respective partial differential equations (PDEs) solutions.
PINNs allow for simulation- and discretization-free optimization and can be trained very efficiently.
arXiv Detail & Related papers (2024-07-10T17:39:50Z) - Transition Path Sampling with Boltzmann Generator-based MCMC Moves [49.69940954060636]
Current approaches to sample transition paths use Markov chain Monte Carlo and rely on time-intensive molecular dynamics simulations to find new paths.
Our approach operates in the latent space of a normalizing flow that maps from the molecule's Boltzmann distribution to a Gaussian, where we propose new paths without requiring molecular simulations.
arXiv Detail & Related papers (2023-12-08T20:05:33Z) - DiffusionPCR: Diffusion Models for Robust Multi-Step Point Cloud
Registration [73.37538551605712]
Point Cloud Registration (PCR) estimates the relative rigid transformation between two point clouds.
We propose formulating PCR as a denoising diffusion probabilistic process, mapping noisy transformations to the ground truth.
Our experiments showcase the effectiveness of our DiffusionPCR, yielding state-of-the-art registration recall rates (95.3%/81.6%) on 3D and 3DLoMatch.
arXiv Detail & Related papers (2023-12-05T18:59:41Z) - Diffusion Methods for Generating Transition Paths [6.222135766747873]
In this work, we seek to simulate rare transitions between metastable states using score-based generative models.
We develop two novel methods for path generation in this paper: a chain-based approach and a midpoint-based approach.
Numerical results of generated transition paths for the M"uller potential and for Alanine dipeptide demonstrate the effectiveness of these approaches in both the data-rich and data-scarce regimes.
arXiv Detail & Related papers (2023-09-19T03:03:03Z) - Enhanced Sampling of Configuration and Path Space in a Generalized
Ensemble by Shooting Point Exchange [71.49868712710743]
We propose a new approach to simulate rare events caused by transitions between long-lived states.
The scheme substantially enhances the efficiency of the transition path sampling simulations.
It yields information on thermodynamics, kinetics and reaction coordinates of molecular processes without distorting their dynamics.
arXiv Detail & Related papers (2023-02-17T08:41:31Z) - Conditioning Normalizing Flows for Rare Event Sampling [61.005334495264194]
We propose a transition path sampling scheme based on neural-network generated configurations.
We show that this approach enables the resolution of both the thermodynamics and kinetics of the transition region.
arXiv Detail & Related papers (2022-07-29T07:56:10Z) - Stochastic Optimal Control for Collective Variable Free Sampling of
Molecular Transition Paths [60.254555533113674]
We consider the problem of sampling transition paths between two given metastable states of a molecular system.
We propose a machine learning method for sampling said transitions.
arXiv Detail & Related papers (2022-06-27T14:01:06Z) - Generative methods for sampling transition paths in molecular dynamics [0.0]
Simulating transition paths linking one metastable state to another one is difficult by direct numerical methods.
We explore two approaches to more efficiently generate transition paths: sampling methods based on generative models such as variational autoencoders, and importance sampling methods based on reinforcement learning.
arXiv Detail & Related papers (2022-05-05T17:50:10Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.