 Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234Mylène Bédard Stochastic Processes and their Applications, 2008, vol. 118, issue 12, 2198-2222 Abstract: Recent optimal scaling theory has produced a condition for the asymptotically optimal acceptance rate of Metropolis algorithms to be the well-known 0.234 when applied to certain multi-dimensional target distributions. These d-dimensional target distributions are formed of independent components, each of which is scaled according to its own function of d. We show that when the condition is not met the limiting process of the algorithm is altered, yielding an asymptotically optimal acceptance rate which might drastically differ from the usual 0.234. Specifically, we prove that as d-->[infinity] the sequence of stochastic processes formed by say the i*th component of each Markov chain usually converges to a Langevin diffusion process with a new speed measure [upsilon], except in particular cases where it converges to a one-dimensional Metropolis algorithm with acceptance rule [alpha]*. We also discuss the use of inhomogeneous proposals, which might prove to be essential in specific cases. Keywords: Weak; convergence; Optimal; scaling; Langevin; diffusion; Generator; Markov; chain; Monte; Carlo (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:118:y:2008:i:12:p:2198-2222 Ordering information: This journal article can be ordered from Access Statistics for this article Stochastic Processes and their Applications is currently edited by T. Mikosch More articles in Stochastic Processes and their Applications from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.