Optimal scalings for local Metropolis--Hastings chains on nonproduct targets in high dimensions

Alexandros Beskos, Gareth Roberts, Andrew Stuart

We investigate local MCMC algorithms, namely the random-walk Metropolis and the Langevin algorithms, and identify the optimal choice of the local step-size as a function of the dim…