Almost sure convergence of the accelerated weight histogram algorithm

Abstract

The accelerated weight histogram (AWH) algorithm is an iterative extended ensemble algorithm, developed for statistical physics and computational biology applications. It is used to estimate free energy differences and expectations with respect to Gibbs measures. The AWH algorithm is based on iterative updates of a design parameter, which is closely related to the free energy, obtained by matching a weight histogram with a specified target distribution. The weight histogram is constructed from samples of a Markov chain on the product of the state space and parameter space. In this paper almost sure convergence of the AWH algorithm is proved, for estimating free energy differences as well as estimating expectations with adaptive ergodic averages. The proof is based on identifying the AWH algorithm as a stochastic approximation and studying the properties of the associated limit ordinary differential equation.

arXiv comment35 pages

References in corpus (8)

• An efficient, multiple range random walk algorithm to calculate the density of states
• Multicanonical Ensemble: A New Approach to Simulate First-order Phase Transitions
• General state space Markov chains and MCMC algorithms
• A New Approach to Spin Glass Simulations
• Fast Algorithm to Calculate Density of States
• Accelerated weight histogram method for exploring free energy landscapes
• Simulation via Direct Computation of Partition Functions
• Riemann metric approach to optimal sampling of multidimensional free-energy landscapes