## The Annals of Applied Probability

### Optimal scaling for the transient phase of the random walk Metropolis algorithm: The mean-field limit

#### Abstract

We consider the random walk Metropolis algorithm on $\mathbb{R}^{n}$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one-dimensional law. In the limit $n\to\infty$, it is well known (see [ Ann. Appl. Probab. 7 (1997) 110–120]) that, when the variance of the proposal scales inversely proportional to the dimension $n$ whereas time is accelerated by the factor $n$, a diffusive limit is obtained for each component of the Markov chain if this chain starts at equilibrium. This paper extends this result when the initial distribution is not the target probability measure. Remarking that the interaction between the components of the chain due to the common acceptance/rejection of the proposed moves is of mean-field type, we obtain a propagation of chaos result under the same scaling as in the stationary case. This proves that, in terms of the dimension $n$, the same scaling holds for the transient phase of the Metropolis–Hastings algorithm as near stationarity. The diffusive and mean-field limit of each component is a diffusion process nonlinear in the sense of McKean. This opens the route to new investigations of the optimal choice for the variance of the proposal distribution in order to accelerate convergence to equilibrium (see [Optimal scaling for the transient phase of Metropolis–Hastings algorithms: The longtime behavior Bernoulli (2014) To appear]).

#### Article information

Source
Ann. Appl. Probab., Volume 25, Number 4 (2015), 2263-2300.

Dates
Revised: December 2013
First available in Project Euclid: 21 May 2015

https://projecteuclid.org/euclid.aoap/1432212442

Digital Object Identifier
doi:10.1214/14-AAP1048

Mathematical Reviews number (MathSciNet)
MR3349007

Zentralblatt MATH identifier
1329.60262

#### Citation

Jourdain, Benjamin; Lelièvre, Tony; Miasojedow, Błażej. Optimal scaling for the transient phase of the random walk Metropolis algorithm: The mean-field limit. Ann. Appl. Probab. 25 (2015), no. 4, 2263--2300. doi:10.1214/14-AAP1048. https://projecteuclid.org/euclid.aoap/1432212442

#### References

• [1] Bédard, M. (2007). Weak convergence of Metropolis algorithms for non-i.i.d. target distributions. Ann. Appl. Probab. 17 1222–1244.
• [2] Bédard, M. (2008). Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234. Stochastic Process. Appl. 118 2198–2222.
• [3] Bédard, M., Douc, R. and Moulines, E. (2012). Scaling analysis of multiple-try MCMC methods. Stochastic Process. Appl. 122 758–786.
• [4] Bédard, M., Douc, R. and Moulines, E. (2014). Scaling analysis of delayed rejection MCMC methods. Methodol. Comput. Appl. Probab. 16 811–838.
• [5] Beskos, A., Pillai, N., Roberts, G., Sanz-Serna, J.-M. and Stuart, A. (2013). Optimal tuning of the hybrid Monte Carlo algorithm. Bernoulli 19 1501–1534.
• [6] Beskos, A., Roberts, G. and Stuart, A. (2009). Optimal scalings for local Metropolis–Hastings chains on nonproduct targets in high dimensions. Ann. Appl. Probab. 19 863–898.
• [7] Breyer, L. A., Piccioni, M. and Scarlatti, S. (2004). Optimal scaling of MaLa for nonlinear regression. Ann. Appl. Probab. 14 1479–1505.
• [8] Breyer, L. A. and Roberts, G. O. (2000). From Metropolis to diffusions: Gibbs states and optimal scaling. Stochastic Process. Appl. 90 181–206.
• [9] Christensen, O. F., Roberts, G. O. and Rosenthal, J. S. (2005). Scaling limits for the transient phase of local Metropolis–Hastings algorithms. J. R. Stat. Soc. Ser. B Stat. Methodol. 67 253–268.
• [10] Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
• [11] Hastings, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57 97–109.
• [12] Jourdain, B., Lelièvre, T. and Miasojedow, B. (2014). Optimal scaling for the transient phase of Metropolis–Hastings algorithms: The longtime behavior. Bernoulli 20 1930–1978.
• [13] Karatzas, I. and Shreve, S. E. (1988). Brownian Motion and Stochastic Calculus, 2nd ed. Springer, New York.
• [14] Mattingly, J. C., Pillai, N. S. and Stuart, A. M. (2012). Diffusion limits of the random walk Metropolis algorithm in high dimensions. Ann. Appl. Probab. 22 881–930.
• [15] Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. and Teller, E. (1953). Equation of state calculations by fast computing machines. J. Chem. Phys. 21 1087–1092.
• [16] Neal, P. and Roberts, G. (2011). Optimal scaling of random walk Metropolis algorithms with non-Gaussian proposals. Methodol. Comput. Appl. Probab. 13 583–601.
• [17] Neal, P., Roberts, G. and Yuen, W. K. (2012). Optimal scaling of random walk Metropolis algorithms with discontinuous target densities. Ann. Appl. Probab. 22 1880–1927.
• [18] Pillai, N. S., Stuart, A. M. and Thiéry, A. H. (2012). Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions. Ann. Appl. Probab. 22 2320–2356.
• [19] Pillai, N. S., Stuart, A. M. and Thiéry, A. H. (2014). Noisy gradient flow from a random walk in Hilbert space. Stoch. PDE: Anal. Comput. 2 196–232.
• [20] Rachev, S. T. and Rüschendorf, L. (1998). Mass Transportation Problems: Theory. Probability and Its Applications (New York) 1. Springer, New York.
• [21] Roberts, G. O., Gelman, A. and Gilks, W. R. (1997). Weak convergence and optimal scaling of random walk Metropolis algorithms. Ann. Appl. Probab. 7 110–120.
• [22] Roberts, G. O. and Rosenthal, J. S. (1998). Optimal scaling of discrete approximations to Langevin diffusions. J. R. Stat. Soc. Ser. B Stat. Methodol. 60 255–268.
• [23] Roberts, G. O. and Rosenthal, J. S. (2001). Optimal scaling for various Metropolis–Hastings algorithms. Statist. Sci. 16 351–367.
• [24] Sznitman, A.-S. (1991). Topics in propagation of chaos. In École D’Été de Probabilités de Saint-Flour XIX—1989. Lecture Notes in Math. 1464 165–251. Springer, Berlin.