Abstract
We consider the problem of optimal scaling of the proposal variance for multidimensional random walk Metropolis algorithms. It is well known, for a wide range of continuous target densities, that the optimal scaling of the proposal variance leads to an average acceptance rate of 0.234. Therefore a natural question is, do similar results hold for target densities which have discontinuities? In the current work, we answer in the affirmative for a class of spherically constrained target densities. Even though the acceptance probability is more complicated than for continuous target densities, the optimal scaling of the proposal variance again leads to an average acceptance rate of 0.234.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Bédard, On the Robustness of Optimal Scaling for Random Walk Metropolis Algorithms, Ph.D. Thesis, University of Toronto, 2006.
M. Bédard, “Weak convergence of Metropolis algorithms for non-IID target distributions,” Annals of Applied Probability, vol. 17 pp. 1222–1244, 2007.
J. Besag, and P. J. Green, “Spatial statistics and Bayesian computation,” Journal of the Royal Statistical Society. Series B vol. 55 pp. 25–37, 1993.
J. Besag, P. J. Green, D. Higdon, and K. Mengersen, “Bayesian computation and stochastic systems,” Statistical Science vol. 10 pp. 3–66, 1995.
P. Billingsley, Convergence of Probability Measures, Wiley: New York, 1968.
L. Breyer, and G. O. Roberts, “From Metropolis to diffusions: Gibbs states and optimal scaling,” Stochastic Processes and their Applications vol. 90 pp. 181–206, 2000.
S. N. Ethier, and T. G. Kurtz, Markov Processes, Characterization and Convergence, Wiley: New York, 1986.
S. P. Meyn, and R. L. Tweedie, Markov Chains and Stochastic Stability, Springer-Verlag: New York, 1993.
P. J. Neal, and G. O. Roberts, “Optimal scaling for partially updating MCMC algorithms,” Annals of Applied Probability vol. 16 pp. 475–515, 2006.
G. O. Roberts, A. Gelman, and W. R. Gilks, “Weak convergence and optimal scaling of Random walk Metropolis algorithms,” Annals of Applied Probability vol. 7 pp. 110–120, 1997.
G. O. Roberts, and J. S. Rosenthal “Optimal scaling of discrete approximations to Langevin diffusions,” Journal of the Royal Statistical Society. Series B vol. 60 pp. 255–268, 1998.
G. O. Roberts, and J. S. Rosenthal, “Optimal scaling for various Metropolis–Hastings algorithms,” Statistical Science vol. 16 pp. 351–367, 2001.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Neal, P., Roberts, G. Optimal Scaling for Random Walk Metropolis on Spherically Constrained Target Densities. Methodol Comput Appl Probab 10, 277–297 (2008). https://doi.org/10.1007/s11009-007-9046-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-007-9046-2