Skip to Main content Skip to Navigation
Journal articles

The Wang-Landau algorithm reaches the Flat Histogram criterion in finite time

Abstract : The Wang-Landau algorithm aims at sampling from a probability distribution, while penalizing some regions of the state space and favouring others. It is widely used, but its convergence properties are still unknown. We show that for some variations of the algorithm, the Wang-Landau algorithm reaches the so-called Flat Histogram criterion in finite time, and that this criterion can be never reached for other variations. The arguments are shown on an simple context -- compact spaces, density functions bounded from both sides-- for the sake of clarity, and could be extended to more general contexts.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00633793
Contributor : Robin Ryder <>
Submitted on : Wednesday, October 19, 2011 - 2:17:17 PM
Last modification on : Wednesday, September 23, 2020 - 4:28:26 AM

Links full text

Identifiers

  • HAL Id : hal-00633793, version 1
  • ARXIV : 1110.4025

Collections

Citation

Pierre Jacob, Robin Ryder. The Wang-Landau algorithm reaches the Flat Histogram criterion in finite time. Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2014, 24 (1), http://www.e-publications.org/ims/submission/index.php/AAP/user/submissionFile/11129?confirm=4fae558. ⟨hal-00633793⟩

Share

Metrics

Record views

243