Optimal scaling for the transient phase of Metropolis Hastings algorithms: The longtime behavior
Benjamin Jourdain, Tony Leli\`evre, B{\l}a\.zej Miasojedow

TL;DR
This paper analyzes the transient behavior of the Random Walk Metropolis algorithm in high dimensions, proving convergence to equilibrium, and discusses optimal scaling strategies for proposals to improve convergence speed.
Contribution
It extends previous diffusive limit results to non-equilibrium initial distributions and confirms the effectiveness of a constant acceptance rate strategy.
Findings
Convergence to equilibrium for the nonlinear McKean SDE.
Validation of the 1/4 to 1/3 acceptance rate range for optimal scaling.
Different scaling behaviors for MALA depending on the distribution's moments.
Abstract
We consider the Random Walk Metropolis algorithm on with Gaussian proposals, and when the target probability measure is the -fold product of a one-dimensional law. It is well known (see Roberts et al. (Ann. Appl. Probab. 7 (1997) 110-120)) that, in the limit , starting at equilibrium and for an appropriate scaling of the variance and of the timescale as a function of the dimension , a diffusive limit is obtained for each component of the Markov chain. In Jourdain et al. (Optimal scaling for the transient phase of the random walk Metropolis algorithm: The mean-field limit (2012) Preprint), we generalize this result when the initial distribution is not the target probability measure. The obtained diffusive limit is the solution to a stochastic differential equation nonlinear in the sense of McKean. In the present paper, we prove convergence to equilibrium…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
