Adaptive Optimal Scaling of Metropolis-Hastings Algorithms Using the Robbins-Monro Process

Details Adaptive Optimal Scaling of Metropolis-Hastings Algorithms Using the Robbins-Monro Process Adaptive Optimal Scaling of Metropolis-Hastings Algorithms Using the Robbins-Monro Process

2010-06-18

arxiv.org/abs/1006.3690v1

Statistics

Methodology

Scientific paper

We present an adaptive method for the automatic scaling of Random-Walk Metropolis-Hastings algorithms, which quickly and robustly identifies the scaling factor that yields a specified overall sampler acceptance probability. Our method relies on the use of the Robbins-Monro search process, whose performance is determined by an unknown steplength constant. We give a very simple estimator of this constant for proposal distributions that are univariate or multivariate normal, together with a sampling algorithm for automating the method. The effectiveness of the algorithm is demonstrated with both simulated and real data examples. This approach could be implemented as a useful component in more complex adaptive Markov chain Monte Carlo algorithms, or as part of automated software packages.

Affiliated with

Also associated with

No associations

Rating

Adaptive Optimal Scaling of Metropolis-Hastings Algorithms Using the Robbins-Monro Process 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 Adaptive Optimal Scaling of Metropolis-Hastings Algorithms Using the Robbins-Monro Process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Optimal Scaling of Metropolis-Hastings Algorithms Using the Robbins-Monro Process will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260606