Long-time convergence of an adaptive biasing force method: Variance reduction by Helmholtz projection

2015/01/28 by Alrachid, Houssam, Lelièvre, Tony · 1 citation
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.1501.07094

Abstract

In this paper, we propose an improvement of the adaptive biasing force (ABF) method, by projecting the estimated mean force onto a gradient. The associated stochastic process satisfies a non linear stochastic differential equation. Using entropy techniques, we prove exponential convergence to the stationary state of this stochastic process. We finally show on some numerical examples that the variance of the approximated mean force is reduced using this technique, which makes the algorithm more efficient than the standard ABF method.

Cited by

• Enhanced Sampling in the Age of Machine Learning: Algorithms and Applications

Related

• Long-time convergence of an Adaptive Biasing Force method
• The Adaptive Biasing Force algorithm with non-conservative forces and related topics
• Adaptive force biasing algorithms: new convergence results and tensor approximations of the bias
• Convergence rates for an Adaptive Biasing Potential scheme from a Wasserstein optimization perspective
• Long-time convergence of an Adaptive Biasing Force method: the bi-channel case