Stochastic Approximation Monte Carlo with a Dynamic Update Factor

Abstract

We present a new Monte Carlo algorithm based on the Stochastic Approximation Monte Carlo (SAMC) algorithm for directly calculating the density of states. The proposed method is Stochastic Approximation with a Dynamic update factor (SAD) which dynamically adjusts the update factor ${\gamma }_t$ during the course of the simulation. We test this method on the square-well fluid and the 31-atom Lennard-Jones cluster and compare the convergence behavior of several related Monte Carlo methods. We find that both the SAD and $1/t$-Wang-Landau ($1/t$-WL) methods rapidly converge to the correct density of states without the need for the user to specify an arbitrary tunable parameter $t_0$ as in the case of SAMC. SAD requires as input the temperature range of interest, in contrast to $1/t$-WL, which requires that the user identify the interesting range of energies. The convergence of the $1/t$-WL method is very sensitive to the energy range chosen for the low-temperature heat capacity of the Lennard-Jones cluster. Thus, SAD is more powerful in the common case in which the range of energies is not known in advance.

References in corpus (26)

• Escaping free-energy minima
• Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms
• An efficient, multiple range random walk algorithm to calculate the density of states
• Multicanonical Ensemble: A New Approach to Simulate First-order Phase Transitions
• Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogram
• Phase changes in 38 atom Lennard-Jones clusters. I: A parallel tempering study in the canonical ensemble
• Fast Algorithm to Calculate Density of States
• On the Thermodynamics of Global Optimization
• Phase changes in 38 atom Lennard-Jones clusters. II: A parallel tempering study of equilibrium and dynamic properties in the molecular dynamics and microcanonical
• Phase Equilibria of Lattice Polymers from Histogram Reweighting Monte Carlo Simulations
• Optimizing the ensemble for equilibration in broad-histogram Monte Carlo simulations
• Wang-Landau Algorithm: a Theoretical Analysis of the Saturation of the Error
• Avoiding Boundary Effects in Wang-Landau Sampling
• Performance Limitations of Flat Histogram Methods and Optimality of Wang-Landau Sampling
• Wang-Landau sampling for quantum systems: algorithms to overcome tunneling problems and calculate the free energy
• Broad Histogram Monte Carlo
• Optimal Modification Factor and Convergence of the Wang-Landau Algorithm
• Analysis of the convergence of the 1/t and Wang-Landau algorithms in the calculation of multidimensional integrals
• Molecular dynamics simulations of lead clusters
• Molecular Dynamics in the Multicanonical Ensemble: Equivalence of Wang-Landau Sampling, Statistical Temperature Molecular Dynamics, and Metadynamics
• Transition Matrix Monte Carlo
• Superposition Enhanced Nested Sampling
• Improving SAMC using smoothing methods: Theory and applications to Bayesian model selection problems
• Intrinsic convergence properties of entropic sampling algorithms
• Convergence of Stochastic Approximation Monte Carlo and modified Wang-Landau algorithms: Tests for the Ising model
• Dynamically Optimized Wang-Landau Sampling with Adaptive Trial Moves and Modification Factors

Cited by in corpus (1)

• Flat histogram method comparison on 2D Ising Model