Score dynamics: scaling molecular dynamics with picoseconds timestep via conditional diffusion model

• URL: http://arxiv.org/abs/2310.01678v4
• Date: Thu, 7 Mar 2024 02:08:41 GMT
• Title: Score dynamics: scaling molecular dynamics with picoseconds timestep via conditional diffusion model
• Authors: Tim Hsu, Babak Sadigh, Vasily Bulatov, Fei Zhou
• Abstract summary: We propose score dynamics (SD), a framework for learning accelerated evolution operators with large timesteps from molecular-dynamics simulations. We construct graph neural network based score dynamics models of realistic molecular systems that are evolved with 10ps timesteps. Our current SD implementation is about two orders of magnitude faster than the MD counterpart for the systems studied in this work.
• Score: 5.39025059364831
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose score dynamics (SD), a general framework for learning accelerated evolution operators with large timesteps from molecular-dynamics simulations. SD is centered around scores, or derivatives of the transition log-probability with respect to the dynamical degrees of freedom. The latter play the same role as force fields in MD but are used in denoising diffusion probability models to generate discrete transitions of the dynamical variables in an SD timestep, which can be orders of magnitude larger than a typical MD timestep. In this work, we construct graph neural network based score dynamics models of realistic molecular systems that are evolved with 10~ps timesteps. We demonstrate the efficacy of score dynamics with case studies of alanine dipeptide and short alkanes in aqueous solution. Both equilibrium predictions derived from the stationary distributions of the conditional probability and kinetic predictions for the transition rates and transition paths are in good agreement with MD. Our current SD implementation is about two orders of magnitude faster than the MD counterpart for the systems studied in this work. Open challenges and possible future remedies to improve score dynamics are also discussed.

Related papers

• Force-Guided Bridge Matching for Full-Atom Time-Coarsened Dynamics of Peptides [17.559471937824767]
  We propose a conditional generative model called Force-guided Bridge Matching (FBM) FBM learns full-atom time-coarsened dynamics and targets the Boltzmann-constrained distribution. Experiments on two datasets consisting of peptides verify our superiority in terms of comprehensive metrics.
  arXiv  Detail & Related papers  (2024-08-27T15:07:27Z)
• Synthetic location trajectory generation using categorical diffusion models [50.809683239937584]
  Diffusion models (DPMs) have rapidly evolved to be one of the predominant generative models for the simulation of synthetic data. We propose using DPMs for the generation of synthetic individual location trajectories (ILTs) which are sequences of variables representing physical locations visited by individuals.
  arXiv  Detail & Related papers  (2024-02-19T15:57:39Z)
• Fast Diffusion Model [122.36693015093041]
  Diffusion models (DMs) have been adopted across diverse fields with their abilities in capturing intricate data distributions. In this paper, we propose a Fast Diffusion Model (FDM) to significantly speed up DMs from a DM optimization perspective.
  arXiv  Detail & Related papers  (2023-06-12T09:38:04Z)
• Timewarp: Transferable Acceleration of Molecular Dynamics by Learning Time-Coarsened Dynamics [24.13304926093212]
  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$.
  arXiv  Detail & Related papers  (2023-02-02T15:48:39Z)
• 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)
• Continuous Forecasting via Neural Eigen Decomposition of Stochastic Dynamics [47.82509795873254]
  We introduce the Neural Eigen-SDE (NESDE) algorithm for sequential prediction with sparse observations and adaptive dynamics. NESDE applies eigen-decomposition to the dynamics model to allow efficient frequent predictions given sparse observations. We are the first to provide a patient-adapted prediction for blood coagulation following Heparin dosing in the MIMIC-IV dataset.
  arXiv  Detail & Related papers  (2022-01-31T22:16:50Z)
• A Note on Learning Rare Events in Molecular Dynamics using LSTM and Transformer [4.80427355202687]
  Recently successful examples on learning slow dynamics by LSTM are given with simulation data of low dimensional reaction coordinate. We show that the following three key factors significantly affect the performance of language model learning, namely dimensionality of reaction coordinates, temporal resolution and state partition.
  arXiv  Detail & Related papers  (2021-07-14T09:26:36Z)
• Influence Estimation and Maximization via Neural Mean-Field Dynamics [60.91291234832546]
  We propose a novel learning framework using neural mean-field (NMF) dynamics for inference and estimation problems. Our framework can simultaneously learn the structure of the diffusion network and the evolution of node infection probabilities.
  arXiv  Detail & Related papers  (2021-06-03T00:02:05Z)
• Dynamic Mode Decomposition in Adaptive Mesh Refinement and Coarsening Simulations [58.720142291102135]
  Dynamic Mode Decomposition (DMD) is a powerful data-driven method used to extract coherent schemes. This paper proposes a strategy to enable DMD to extract from observations with different mesh topologies and dimensions.
  arXiv  Detail & Related papers  (2021-04-28T22:14:25Z)
• Accelerating Training in Artificial Neural Networks with Dynamic Mode Decomposition [0.0]
  We propose a method to decouple the evaluation of the update rule at each weight. By fine-tuning the number of backpropagation steps used for each DMD model estimation, a significant reduction in the number of operations required to train the neural networks can be achieved.
  arXiv  Detail & Related papers  (2020-06-18T22:59:55Z)
• Liquid Time-constant Networks [117.57116214802504]
  We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system's dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations.
  arXiv  Detail & Related papers  (2020-06-08T09:53:35Z)

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.