Transition Path Sampling with Boltzmann Generator-based MCMC Moves
- URL: http://arxiv.org/abs/2312.05340v2
- Date: Tue, 28 May 2024 14:50:41 GMT
- Title: Transition Path Sampling with Boltzmann Generator-based MCMC Moves
- Authors: Michael Plainer, Hannes Stärk, Charlotte Bunne, Stephan Günnemann,
- Abstract summary: 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.
- Score: 49.69940954060636
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Sampling all possible transition paths between two 3D states of a molecular system has various applications ranging from catalyst design to drug discovery. 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. Using alanine dipeptide, we explore Metropolis-Hastings acceptance criteria in the latent space for exact sampling and investigate different latent proposal mechanisms.
Related papers
- Collective Variable Free Transition Path Sampling with Generative Flow Network [10.210248065533133]
We propose to leverage generative flow networks (GFlowNets) to sample transition paths without relying on collective variables (CVs)
We reformulate the problem as amortized energy-based sampling over transition paths and train a neural bias potential by minimizing the squared log-ratio between the target distribution and the generator.
Our approach, called TPS-GFN, generates more realistic and diverse transition paths than the previous CV-free machine learning approach.
arXiv Detail & Related papers (2024-05-30T11:32:42Z) - Conditional Normalizing Flows for Active Learning of Coarse-Grained Molecular Representations [0.6906005491572401]
generative machine learning methods such as normalizing flows have been used to learn the Boltzmann distribution directly, without samples.
In this work, we address this challenge by separating the problem into two levels, the fine-grained and coarse-grained degrees of freedom.
To explore the configurational space, we employ coarse-grained simulations with active learning which allows us to update the flow and make all-atom potential energy evaluations only when necessary.
arXiv Detail & Related papers (2024-02-02T07:44:26Z) - 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) - Manifold Interpolating Optimal-Transport Flows for Trajectory Inference [64.94020639760026]
We present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow)
MIOFlow learns, continuous population dynamics from static snapshot samples taken at sporadic timepoints.
We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.
arXiv Detail & Related papers (2022-06-29T22:19:03Z) - 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) - Sampling in Combinatorial Spaces with SurVAE Flow Augmented MCMC [83.48593305367523]
Hybrid Monte Carlo is a powerful Markov Chain Monte Carlo method for sampling from complex continuous distributions.
We introduce a new approach based on augmenting Monte Carlo methods with SurVAE Flows to sample from discrete distributions.
We demonstrate the efficacy of our algorithm on a range of examples from statistics, computational physics and machine learning, and observe improvements compared to alternative algorithms.
arXiv Detail & Related papers (2021-02-04T02:21:08Z)
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.