论文信息 - Optimal Scaling for Random Walk Metropolis on Spherically Constrained Target Densities

Optimal Scaling for Random Walk Metropolis on Spherically Constrained Target Densities

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.

G. Roberts | P. Neal

[1] P. Billingsley,et al. Convergence of Probability Measures , 1969 .

[2] P. Donnelly. MARKOV PROCESSES Characterization and Convergence (Wiley Series in Probability and Mathematical Statistics) , 1987 .

[3] J. Besag,et al. Spatial Statistics and Bayesian Computation , 1993 .

[4] Richard L. Tweedie,et al. Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[5] J. Besag,et al. Bayesian Computation and Stochastic Systems , 1995 .

[6] A. Gelman,et al. Weak convergence and optimal scaling of random walk Metropolis algorithms , 1997 .

[7] J. Rosenthal,et al. Optimal scaling of discrete approximations to Langevin diffusions , 1998 .

[8] Gareth O. Roberts,et al. From metropolis to diffusions: Gibbs states and optimal scaling , 2000 .

[9] J. Rosenthal,et al. Optimal scaling for various Metropolis-Hastings algorithms , 2001 .

[10] F. S.,et al. Necessary conditions for geometric and polynomial ergodicity of random walk-type Markov chains , 2001 .

[11] S. Ethier,et al. Markov Processes: Characterization and Convergence , 2005 .

[12] M. Bédard. On the robustness of optimal scaling for random walk metropolis algorithms , 2006 .

[13] G. Roberts,et al. OPTIMAL SCALING FOR PARTIALLY UPDATING MCMC ALGORITHMS , 2006, math/0607054.

[14] M. B'edard. Weak convergence of Metropolis algorithms for non-i.i.d. target distributions , 2007, 0710.3684.