Timewarp: Transferable Acceleration of Molecular Dynamics by Learning Time-Coarsened Dynamics

• URL: http://arxiv.org/abs/2302.01170v2
• Date: Fri, 1 Dec 2023 13:21:51 GMT
• Title: Timewarp: Transferable Acceleration of Molecular Dynamics by Learning Time-Coarsened Dynamics
• Authors: Leon Klein, Andrew Y. K. Foong, Tor Erlend Fjelde, Bruno Mlodozeniec, Marc Brockschmidt, Sebastian Nowozin, Frank No\'e, Ryota Tomioka
• Abstract summary: We present Timewarp, an enhanced sampling method which uses a normalising flow as a proposal distribution in a Markov chain Monte Carlo method. The flow is trained offline on MD trajectories and learns to make large steps in time, simulating the molecular dynamics of $105 - 106:textrmfs$.
• Score: 24.13304926093212
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Molecular dynamics (MD) simulation is a widely used technique to simulate molecular systems, most commonly at the all-atom resolution where equations of motion are integrated with timesteps on the order of femtoseconds ($1\textrm{fs}=10^{-15}\textrm{s}$). MD is often used to compute equilibrium properties, which requires sampling from an equilibrium distribution such as the Boltzmann distribution. However, many important processes, such as binding and folding, occur over timescales of milliseconds or beyond, and cannot be efficiently sampled with conventional MD. Furthermore, new MD simulations need to be performed for each molecular system studied. We present Timewarp, an enhanced sampling method which uses a normalising flow as a proposal distribution in a Markov chain Monte Carlo method targeting the Boltzmann distribution. The flow is trained offline on MD trajectories and learns to make large steps in time, simulating the molecular dynamics of $10^{5} - 10^{6}\:\textrm{fs}$. Crucially, Timewarp is transferable between molecular systems: once trained, we show that it generalises to unseen small peptides (2-4 amino acids) at all-atom resolution, exploring their metastable states and providing wall-clock acceleration of sampling compared to standard MD. Our method constitutes an important step towards general, transferable algorithms for accelerating MD.

Related papers

• Conditional Synthesis of 3D Molecules with Time Correction Sampler [58.0834973489875]
  Time-Aware Conditional Synthesis (TACS) is a novel approach to conditional generation on diffusion models. It integrates adaptively controlled plug-and-play "online" guidance into a diffusion model, driving samples toward the desired properties.
  arXiv  Detail & Related papers  (2024-11-01T12:59:25Z)
• 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)
• A Multi-Grained Symmetric Differential Equation Model for Learning Protein-Ligand Binding Dynamics [73.35846234413611]
  In drug discovery, molecular dynamics (MD) simulation provides a powerful tool for predicting binding affinities, estimating transport properties, and exploring pocket sites. We propose NeuralMD, the first machine learning (ML) surrogate that can facilitate numerical MD and provide accurate simulations in protein-ligand binding dynamics. We demonstrate the efficiency and effectiveness of NeuralMD, achieving over 1K$times$ speedup compared to standard numerical MD simulations.
  arXiv  Detail & Related papers  (2024-01-26T09:35:17Z)
• Towards Predicting Equilibrium Distributions for Molecular Systems with Deep Learning [60.02391969049972]
  We introduce a novel deep learning framework, called Distributional Graphormer (DiG), in an attempt to predict the equilibrium distribution of molecular systems. DiG employs deep neural networks to transform a simple distribution towards the equilibrium distribution, conditioned on a descriptor of a molecular system.
  arXiv  Detail & Related papers  (2023-06-08T17:12:08Z)
• Implicit Transfer Operator Learning: Multiple Time-Resolution Surrogates for Molecular Dynamics [8.35780131268962]
  We present Implict Transfer Operator (ITO) Learning, a framework to learn surrogates of the simulation process with multiple time-resolutions. We also present a coarse-grained CG-SE3-ITO model which can quantitatively model all-atom molecular dynamics.
  arXiv  Detail & Related papers  (2023-05-29T12:19:41Z)
• Exploring Chemical Space with Score-based Out-of-distribution Generation [57.15855198512551]
  We propose a score-based diffusion scheme that incorporates out-of-distribution control in the generative differential equation (SDE) Since some novel molecules may not meet the basic requirements of real-world drugs, MOOD performs conditional generation by utilizing the gradients from a property predictor. We experimentally validate that MOOD is able to explore the chemical space beyond the training distribution, generating molecules that outscore ones found with existing methods, and even the top 0.01% of the original training pool.
  arXiv  Detail & Related papers  (2022-06-06T06:17:11Z)
• Accurate Machine Learned Quantum-Mechanical Force Fields for Biomolecular Simulations [51.68332623405432]
  Molecular dynamics (MD) simulations allow atomistic insights into chemical and biological processes. Recently, machine learned force fields (MLFFs) emerged as an alternative means to execute MD simulations. This work proposes a general approach to constructing accurate MLFFs for large-scale molecular simulations.
  arXiv  Detail & Related papers  (2022-05-17T13:08:28Z)
• Simulate Time-integrated Coarse-grained Molecular Dynamics with Multi-Scale Graph Networks [4.444748822792469]
  Learning-based force fields have made significant progress in accelerating ab-initio MD simulation but are not fast enough for many real-world applications. We aim to address these challenges by learning a multi-scale graph neural network that directly simulates coarse-grained MD with a very large time step.
  arXiv  Detail & Related papers  (2022-04-21T18:07:08Z)
• A Score-based Geometric Model for Molecular Dynamics Simulations [33.158796937777886]
  We propose a novel model called ScoreMD to estimate the gradient of the log density of molecular conformations. With multiple architectural improvements, we outperforms state-of-the-art baselines on MD17 and isomers of C7O2H10. This research provides new insights into the acceleration of new material and drug discovery.
  arXiv  Detail & Related papers  (2022-04-19T05:13:46Z)
• NNP/MM: Accelerating molecular dynamics simulations with machine learning potentials and molecular mechanic [38.50309739333058]
  We introduce an optimized implementation of the hybrid method (NNP/MM), which combines neural network potentials (NNP) and molecular mechanics (MM) This approach models a portion of the system, such as a small molecule, using NNP while employing MM for the remaining system to boost efficiency. It has enabled us to increase the simulation speed by 5 times and achieve a combined sampling of one microsecond for each complex, marking the longest simulations ever reported for this class of simulation.
  arXiv  Detail & Related papers  (2022-01-20T10:57:20Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)

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.