Scaling of proposals for Metropolis algorithms is an important practical problem in Markov chain Monte Carlo implementation. Analyses of the random walk Metropolis for high-dimensional targets with specific functional forms have shown that in many cases the optimal scaling is achieved when the acceptance rate is approximately 0.234, but that there are exceptions. We present a general set of sufficient conditions which are invariant to orthonormal transformation of the coordinate axes and which ensure that the limiting optimal acceptance rate is 0.234. The criteria are shown to hold for the joint distribution of successive elements of a stationary pth-order multivariate Markov process.
Chris Sherlock. "Optimal scaling of the random walk Metropolis: general criteria for the 0.234 acceptance rule." J. Appl. Probab. 50 (1) 1 - 15, March 2013. https://doi.org/10.1239/jap/1363784420