Statistics – Computation
Scientific paper
2011-09-18
Statistics
Computation
Scientific paper
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 which we feel deserves much further attention. Towards this aim, this paper 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 which both decreases computational cost as well as stabilizes the algorithm, improving its ability to explore the density. Performance is studied in several applications. Through a Bayesian variable selection example, the authors demonstrate the convergence gains obtained with interacting chains. The ability of the algorithm's adaptive proposal to induce mode-jumping is illustrated through a trimodal density and a Bayesian mixture modeling application. Lastly, through a 2D Ising model, the authors demonstrate the ability of the algorithm to overcome the high correlations encountered in spatial models.
Bornn Luke
Doucet Arnaud
Jacob Pierre
Moral Pierre Del
No associations
LandOfFree
An Adaptive Interacting Wang-Landau Algorithm for Automatic Density Exploration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Adaptive Interacting Wang-Landau Algorithm for Automatic Density Exploration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Adaptive Interacting Wang-Landau Algorithm for Automatic Density Exploration will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-560147