SearcharxivSearch

arXiv · 1910.04428

Analysis of an Adaptive Biasing Force method based on self-interacting dynamics

Abstract

This article fills a gap in the mathematical analysis of Adaptive Biasing algorithms, which are extensively used in molecular dynamics computations. Given a reaction coordinate, ideally, the bias in the overdamped Langevin dynamics would be given by the gradient of the associated free energy function, which is unknown. We consider an adaptive biased version of the overdamped dynamics, where the bias depends on the past of the trajectory and is designed to approximate the free energy. The main result of this article is the consistency and efficiency of this approach. More precisely we prove the almost sure convergence of the bias as time goes to infinity, and that the limit is close to the ideal bias, as an auxiliary parameter of the algorithm goes to $0$. The proof is based on interpreting the process as a self-interacting dynamics, and on the study of a non-trivial fixed point problem for the limiting flow obtained using the ODE method.

Explore related subjects

Keep this discovery

BibTeXRIS

Michel Benaïm, Charles-Edouard Bréhier, Pierre Monmarché. 2019-10-10. Analysis of an Adaptive Biasing Force method based on self-interacting dynamics. https://arxiv.org/abs/1910.04428

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR