An Adaptive Interacting Wang–Landau Algorithm for Automatic Density Exploration
Bornn, Luke; Del Moral, Pierre; Doucet, Arnaud; Jacob, Pierre E. (2013), An Adaptive Interacting Wang–Landau Algorithm for Automatic Density Exploration, Journal of Computational and Graphical Statistics, 22, 3, p. 749-773. http://dx.doi.org/10.1080/10618600.2012.723569
TypeArticle accepté pour publication ou publié
Journal nameJournal of Computational and Graphical Statistics
MetadataShow full item record
Abstract (EN)While statisticians are well-accustomed to performing exploratory analysis in the modeling stage of an analysis, the notion of conducting preliminary general-purpose exploratory analysis in the Monte Carlo stage (or more generally, the model-fitting stage) of an analysis is an area that we feel deserves much further attention. Toward this aim, this article proposes a general-purpose algorithm for automatic density exploration. The proposed exploration algorithm combines and expands upon components from various adaptive Markov chain Monte Carlo methods, with the Wang–Landau algorithm at its heart. Additionally, the algorithm is run on interacting parallel chains—a feature that both decreases computational cost as well as stabilizes the algorithm, improving its ability to explore the density. Performance of this new parallel adaptive Wang–Landau algorithm is studied in several applications. Through a Bayesian variable selection example, we demonstrate the convergence gains obtained with interacting chains. The ability of the algorithm’s adaptive proposal to induce mode-jumping is illustrated through a Bayesian mixture modeling application. Last, through a two-dimensional Ising model, the authors demonstrate the ability of the algorithm to overcome the high correlations encountered in spatial models. Supplemental materials are available online.
Subjects / KeywordsWang-Landau algorithm; Parallel chains; Adaptive Markov chain Monte Carlo; Adaptive binning
Showing items related by title and author.
Some discussions of D. Fearnhead and D. Prangle's Read Paper "Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation" Singh, Sumeetpal S.; Sedki, Mohammed; Jasra, Ajay; Pudlo, Pierre; Robert, Christian P.; Lee, Anthony; Marin, Jean-Michel; Kosmidis, Ioannis; Girolami, Mark; Andrieu, Christophe; Cornebise, Julien; Doucet, Arnaud; Barthelme, Simon; Chopin, Nicolas (2012) Article accepté pour publication ou publié
Adaptive greedy algorithm for moderately large dimensions in kernel conditional density estimation Nguyen, Minh-Lien; Lacour, Claire; Rivoirard, Vincent (2022) Article accepté pour publication ou publié
Barthelme, Simon; Beffy, Magali; Chopin, Nicolas; Doucet, Arnaud; Jacob, Pierre E.; Johansen, Adam M.; Marin, Jean-Michel; Robert, Christian P. (2011) Document de travail / Working paper
Derivative-Free Estimation of the Score Vector and Observed Information Matrix with Application to State-Space Models Rubenthaler, Sylvain; Jacob, Pierre E.; Doucet, Arnaud (2013) Document de travail / Working paper