Automatic Step Size Selection in Random Walk Metropolis Algorithms

Details Automatic Step Size Selection in Random Walk Metropolis Algorithms Automatic Step Size Selection in Random Walk Metropolis Algorithms

2011-03-30

arxiv.org/abs/1103.5986v1

Statistics

Computation

13 pages, 2 figures

Scientific paper

Practitioners of Markov chain Monte Carlo (MCMC) may hesitate to use random walk Metropolis-Hastings algorithms, especially variable-at-a-time algorithms with many parameters, because these algorithms require users to select values of tuning parameters (step sizes). These algorithms perform poorly if the step sizes are set to be too low or too high. We show in this paper that it is not difficult for an algorithm to tune these step sizes automatically to obtain a desired acceptance probability, since the logit of the acceptance probability is very nearly linear in the log of the step size, with known slope coefficient. These ideas work in most applications, including single parameter or block moves on the linear, log, or logit scales. We discuss the implementation of this algorithm in the software package YADAS.

Affiliated with

Also associated with

No associations

Rating

Automatic Step Size Selection in Random Walk Metropolis Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Automatic Step Size Selection in Random Walk Metropolis Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic Step Size Selection in Random Walk Metropolis Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-569652