Transition Path Sampling with Boltzmann Generator-based MCMC Moves

Michael Plainer, Hannes Stärk, Charlotte Bunne, Stephan Günnemann
12/8/2023
q-bio.QMcs.LG

No official code found. Best implementation: plainerman/Latent-TPS (6 stars, MIT, last commit 2024-05-07).

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.

View on arXivView PDF

Code Implementations(1)

MIT

Source code of the paper: Transition Path Sampling with Boltzmann Generator-based MCMC Moves

61Python, Jupyter NotebookNov 21, 20232 years agoMIT

Similar Papers

Cite this paper

@article{plainer2023transition,
  title  = {Transition Path Sampling with Boltzmann Generator-based MCMC Moves},
  author = {Michael Plainer and Hannes Stärk and Charlotte Bunne and Stephan Günnemann},
  year   = {2023},
  eprint = {2312.05340},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.05340v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2312.05340.svg)](https://codeofpaper.com/paper/2312.05340)

Discussion