arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0708.0711math.STstat.COstat.TH
收藏

自适应混合重要抽样方案的收敛性

Convergence of adaptive mixtures of importance sampling schemes

R. Douc, A. Guillin, J. -M. Marin, C. P. Robert

摘要:

在设计有效的模拟算法时,常常会遇到选择不佳的建议分布的问题。虽然一个给定的模拟内核的性能可以澄清后验如何充分这个内核是手头的问题,一个永久的在线修改内核的有效性所产生的算法引起关注。虽然这个问题对于MCMC算法来说是最棘手的,但重要性采样算法的等效版本可以相当精确地验证。我们推导出充分的收敛条件自适应混合人口蒙特卡罗算法,并表明饶-Blackwellized版本渐近实现最佳的Kullback发散准则,而更基本的版本不受益于重复更新。

英文摘要:

In the design of efficient simulation algorithms, one is often beset with a poor choice of proposal distributions. Although the performance of a given simulation kernel can clarify a posteriori how adequate this kernel is for the problem at hand, a permanent on-line modification of kernels causes concerns about the validity of the resulting algorithm. While the issue is most often intractable for MCMC algorithms, the equivalent version for importance sampling algorithms can be validated quite precisely. We derive sufficient convergence conditions for adaptive mixtures of population Monte Carlo algorithms and show that Rao--Blackwellized versions asymptotically achieve an optimum in terms of a Kullback divergence criterion, while more rudimentary versions do not benefit from repeated updating.

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

↑