arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0908.3553math.STstat.TH
收藏

使用平滑方法改进SAMC:理论和在贝叶斯模型选择问题中的应用

Improving SAMC using smoothing methods: Theory and applications to Bayesian model selection problems

Faming Liang

摘要:

随机逼近蒙特卡罗(SAMC)最近由Liang,Liu和Carroll [J. Amer. Statistist. Assoc.102(2007)305- 320]作为通用模拟和优化算法。在本文中,我们提出了改善其收敛性的平滑方法,并讨论了新算法的贝叶斯模型选择问题的应用。通过一个变点识别实例对新算法进行了测试。数值结果表明,新算法在模型选择问题上的性能明显优于SAMC和可逆跳MCMC。新算法是随机逼近马尔可夫链蒙特卡罗算法的一般形式。它允许在每次迭代时生成多个样本,并在参数更新步骤中包含偏置项。在可验证的条件下,给出了一般算法收敛性的严格证明。本文还提供了一个框架,如何提高效率的Monte Carlo模拟结合一些非参数技术。

英文摘要:

Stochastic approximation Monte Carlo (SAMC) has recently been proposed by Liang, Liu and Carroll [J. Amer. Statist. Assoc. 102 (2007) 305--320] as a general simulation and optimization algorithm. In this paper, we propose to improve its convergence using smoothing methods and discuss the application of the new algorithm to Bayesian model selection problems. The new algorithm is tested through a change-point identification example. The numerical results indicate that the new algorithm can outperform SAMC and reversible jump MCMC significantly for the model selection problems. The new algorithm represents a general form of the stochastic approximation Markov chain Monte Carlo algorithm. It allows multiple samples to be generated at each iteration, and a bias term to be included in the parameter updating step. A rigorous proof for the convergence of the general algorithm is established under verifiable conditions. This paper also provides a framework on how to improve efficiency of Monte Carlo simulations by incorporating some nonparametric techniques.

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

↑