arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.5239stat.COcs.AI
收藏

大翻转重要性抽样

Large-Flip Importance Sampling

Computer Science, UBC(不列颠哥伦比亚大学计算机科学系)

Firas Hamze, Nando de Freitas

摘要:

提出了一种新的求解复杂离散分布的蒙特卡罗算法。该算法的动机是N-Fold Way,这是一种巧妙的事件驱动MCMC采样器,可以避免在任何特定状态下的拒绝移动。然而,N重方式可能会被“困”在循环中。我们通过修改采样过程克服了这个问题。这种校正确实会引入偏差,但随后会使用精心设计的重要性采样器来校正偏差。

英文摘要:

We propose a new Monte Carlo algorithm for complex discrete distributions. The algorithm is motivated by the N-Fold Way, which is an ingenious event-driven MCMC sampler that avoids rejection moves at any specific state. The N-Fold Way can however get "trapped" in cycles. We surmount this problem by modifying the sampling process. This correction does introduce bias, but the bias is subsequently corrected with a carefully engineered importance sampler.

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

↑