arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1109.3829stat.COstat.APstat.ME
收藏

一种用于自动密度探测的自适应交互式Wang-Landau算法

An Adaptive Interacting Wang-Landau Algorithm for Automatic Density Exploration

Luke Bornn, Pierre Jacob, Pierre Del Moral, Arnaud Doucet

摘要:

虽然统计学家已经习惯于在分析的建模阶段进行探索性分析,但在分析的蒙特卡罗阶段(或更一般地说,模型拟合阶段)进行初步通用探索性分析的概念是一个值得进一步关注的领域。针对这一目标,本文提出了一种通用的自动密度探测算法。所提出的探索算法结合并扩展了各种自适应马尔可夫链蒙特卡罗方法的组件,其核心是Wang-Landau算法。此外,该算法在相互作用的并行链上运行-这一特性既降低了计算成本,又稳定了算法,提高了其探索密度的能力。性能研究在几个应用程序。通过一个贝叶斯变量选择的例子,证明了相互作用链的收敛增益。通过三峰密度和贝叶斯混合建模应用程序的算法的自适应建议,以诱导模式跳跃的能力。最后,通过一个二维伊辛模型,作者证明了该算法克服空间模型中遇到的高相关性的能力。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑