Dynamical Computation of the Density of States and Bayes Factors Using Nonequilibrium Importance Sampling

Computing equilibrium free energies through a nonequilibrium quench

Many methods to accelerate sampling of molecular configurations are based on the idea that temperature can be used to accelerate rare transitions. These methods typically compute equilibrium properties at a target temperature using reweighting or through Monte Carlo exchanges between replicas at higher temperatures. A recent paper [G. M. Rotskoff and E. Vanden-Eijnden, Phys. Rev. Lett. 122, 150602 (2019)] demonstrated that accurate equilibrium densities of states can also be computed through a nonequilibrium "quench" process, where sampling is performed at a higher temperature to encourage rapid mixing and then quenched to lower energy states with dissipative dynamics. Here, we provide an implementation of the quench dynamics in LAMMPS and evaluate a new formulation of nonequilibrium estimators for the computation of partition functions or free energy surfaces (FESs) of molecular systems. We show that the method is exact for a minimal model of N-independent harmonic springs and use these analytical results to develop heuristics for the amount of quenching required to obtain accurate sampling. We then test the quench approach on alanine dipeptide, where we show that it gives an FES that is accurate near the most stable configurations using the quench approach but disagrees with a reference umbrella sampling calculation in high FE regions. We then show that combining quenching with umbrella sampling allows the efficient calculation of the free energy in all regions. Moreover, by using this combined scheme, we obtain the FES across a range of temperatures at no additional cost, making it much more efficient than standard umbrella sampling if this information is required. Finally, we discuss how this approach can be extended to solute tempering and demonstrate that it is highly accurate for the case of solvated alanine dipeptide without any additional modifications.

Differentiable samplers for deep latent variable models

Latent variable models are a popular class of models in statistics. Combined with neural networks to improve their expressivity, the resulting deep latent variable models have also found numerous applications in machine learning. A drawback of these models is that their likelihood function is intractable so approximations have to be carried out to perform inference. A standard approach consists of maximizing instead an evidence lower bound (ELBO) obtained based on a variational approximation of the posterior distribution of the latent variables. The standard ELBO can, however, be a very loose bound if the variational family is not rich enough. A generic strategy to tighten such bounds is to rely on an unbiased low-variance Monte Carlo estimate of the evidence. We review here some recent importance sampling, Markov chain Monte Carlo and sequential Monte Carlo strategies that have been proposed to achieve this. This article is part of the theme issue 'Bayesian inference: challenges, perspectives, and prospects'.

Physics-informed graph neural networks enhance scalability of variational nonequilibrium optimal control

When a physical system is driven away from equilibrium, the statistical distribution of its dynamical trajectories informs many of its physical properties. Characterizing the nature of the distribution of dynamical observables, such as a current or entropy production rate, has become a central problem in nonequilibrium statistical mechanics. Asymptotically, for a broad class of observables, the distribution of a given observable satisfies a large deviation principle when the dynamics is Markovian, meaning that fluctuations can be characterized in the long-time limit by computing a scaled cumulant generating function. Calculating this function is not tractable analytically (nor often numerically) for complex, interacting systems, so the development of robust numerical techniques to carry out this computation is needed to probe the properties of nonequilibrium materials. Here, we describe an algorithm that recasts this task as an optimal control problem that can be solved variationally. We solve for optimal control forces using neural network ansätze that are tailored to the physical systems to which the forces are applied. We demonstrate that this approach leads to transferable and accurate solutions in two systems featuring large numbers of interacting particles.

Accelerated Jarzynski estimator with deterministic virtual trajectories

The Jarzynski estimator is a powerful tool that uses nonequilibrium statistical physics to numerically obtain partition functions of probability distributions. The estimator reconstructs partition functions with trajectories of the simulated Langevin dynamics through the Jarzynski equality. However, the original estimator suffers from slow convergence because it depends on rare trajectories of stochastic dynamics. In this paper, we present a method to significantly accelerate the convergence by introducing deterministic virtual trajectories generated in augmented state space under the Hamiltonian dynamics. We theoretically show that our approach achieves second-order acceleration compared to a naive estimator with the Langevin dynamics and zero variance estimation on harmonic potentials. We also present numerical experiments on three multimodal distributions and a practical example in which the proposed method outperforms the conventional method, and we provide theoretical explanations.

A gentle introduction to the non-equilibrium physics of trajectories: Theory, algorithms, and biomolecular applications

Despite the importance of non-equilibrium statistical mechanics in modern physics and related fields, the topic is often omitted from undergraduate and core-graduate curricula. Key aspects of non-equilibrium physics, however, can be understood with a minimum of formalism based on a rigorous trajectory picture. The fundamental object is the ensemble of trajectories, a set of independent time-evolving systems, which easily can be visualized or simulated (e.g., for protein folding) and which can be analyzed rigorously in analogy to an ensemble of static system configurations. The trajectory picture provides a straightforward basis for understanding first-passage times, "mechanisms" in complex systems, and fundamental constraints on the apparent reversibility of complex processes. Trajectories make concrete the physics underlying the diffusion and Fokker-Planck partial differential equations. Last but not least, trajectory ensembles underpin some of the most important algorithms that have provided significant advances in biomolecular studies of protein conformational and binding processes.

TYROSINE KINASES: COMPLEX MOLECULAR SYSTEMS CHALLENGING COMPUTATIONAL METHODOLOGIES

Classical molecular dynamics (MD) simulations based on atomic models play an increasingly important role in a wide range of applications in physics, biology, and chemistry. Nonetheless, generating genuine knowledge about biological systems using MD simulations remains challenging. Protein tyrosine kinases are important cellular signaling enzymes that regulate cell growth, proliferation, metabolism, differentiation, and migration. Due to the large conformational changes and long timescales involved in their function, these kinases present particularly challenging problems to modern computational and theoretical frameworks aimed at elucidating the dynamics of complex biomolecular systems. Markov state models have achieved limited success in tackling the broader conformational ensemble and biased methods are often employed to examine specific long timescale events. Recent advances in machine learning continue to push the limitations of current methodologies and provide notable improvements when integrated with the existing frameworks. A broad perspective is drawn from a critical review of recent studies.