arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0710.3684math.PR
收藏

非i.i.d.的Metropolis算法的Weak convergence。目标分布

Weak convergence of Metropolis algorithms for non-i.i.d. target distributions

Mylène Bédard

摘要:

在本文中,我们将优化的多维目标分布与尺度可能取决于尺寸的Metropolis算法的效率。我们提出了一种方法,用于确定适当的形式的缩放的建议分布作为一个功能的尺寸,这导致了一个渐近扩散定理的证明。我们表明,当不存在任何组件的缩放项显着小于的其他,渐近最优的接受率是众所周知的0.234。

英文摘要:

In this paper, we shall optimize the efficiency of Metropolis algorithms for multidimensional target distributions with scaling terms possibly depending on the dimension. We propose a method for determining the appropriate form for the scaling of the proposal distribution as a function of the dimension, which leads to the proof of an asymptotic diffusion theorem. We show that when there does not exist any component with a scaling term significantly smaller than the others, the asymptotically optimal acceptance rate is the well-known 0.234.

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

↑