首页 | 本学科首页   官方微博 | 高级检索  
     


Acceleration of the Multiple-Try Metropolis algorithm using antithetic and stratified sampling
Authors:Radu V. Craiu  Christiane Lemieux
Affiliation:(1) Department of Statistics, University of Toronto, 100 St. George Street, Toronto, ON, M5S 3G3, Canada;(2) Department of Statistics and Actuarial Science, University of Waterloo, 200 University Avenue West, Waterloo, ON, N2L 3G1, Canada
Abstract:
The Multiple-Try Metropolis is a recent extension of the Metropolis algorithm in which the next state of the chain is selected among a set of proposals. We propose a modification of the Multiple-Try Metropolis algorithm which allows for the use of correlated proposals, particularly antithetic and stratified proposals. The method is particularly useful for random walk Metropolis in high dimensional spaces and can be used easily when the proposal distribution is Gaussian. We explore the use of quasi Monte Carlo (QMC) methods to generate highly stratified samples. A series of examples is presented to evaluate the potential of the method.
Keywords:Antithetic variates  Markov Chain Monte Carlo  Extreme antithesis  Korobov rule  Latin Hypercube sampling  Quasi Monte Carlo  Sobol’   sequence  Multiple-Try Metropolis  Random-Ray Monte Carlo
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号