arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1601.05633stat.ME
收藏

一种求解多模态问题的排斥-吸引Metropolis算法

A Repelling-Attracting Metropolis Algorithm for Multimodality

Hyungsuk Tak, Xiao-Li Meng, David A. van Dyk

摘要:

虽然Metropolis算法易于实现,但它在探索多峰分布时往往存在困难。我们提出了排斥吸引大都市(RAM)算法,保持简单的大都市算法的实现性质,但更有可能在模式之间跳转。RAM算法是一种梅特罗波利斯-黑斯廷斯算法,其建议包括密度的下坡移动,旨在使局部模式排斥,随后是密度的上坡移动,旨在使局部模式吸引。下坡移动通过Metropolis比率的倒数来实现,因此算法更倾向于向下移动。上坡移动做相反的使用标准的大都会比率,更喜欢向上移动。这种密度的上下移动增加了提议移动到不同模式的概率。由于该建议的接受概率涉及一个比率的棘手的积分,我们引入了一个辅助变量,它创建了一个长期的接受概率,取消与棘手的比率。使用几个例子,我们证明了潜在的RAM算法,探索一个多峰分布更有效地比大都市算法,并与较少的调整比通常所需的回火为基础的方法。

英文摘要:

Although the Metropolis algorithm is simple to implement, it often has difficulties exploring multimodal distributions. We propose the repelling-attracting Metropolis (RAM) algorithm that maintains the simple-to-implement nature of the Metropolis algorithm, but is more likely to jump between modes. The RAM algorithm is a Metropolis-Hastings algorithm with a proposal that consists of a downhill move in density that aims to make local modes repelling, followed by an uphill move in density that aims to make local modes attracting. The downhill move is achieved via a reciprocal Metropolis ratio so that the algorithm prefers downward movement. The uphill move does the opposite using the standard Metropolis ratio which prefers upward movement. This down-up movement in density increases the probability of a proposed move to a different mode. Because the acceptance probability of the proposal involves a ratio of intractable integrals, we introduce an auxiliary variable which creates a term in the acceptance probability that cancels with the intractable ratio. Using several examples, we demonstrate the potential for the RAM algorithm to explore a multimodal distribution more efficiently than a Metropolis algorithm and with less tuning than is commonly required by tempering-based methods.

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

↑