Counterexamples for optimal scaling of Metropolis-Hastings chains with rough target densities

10/21/2019
by   Jure Vogrinc, et al.
0

For sufficiently smooth targets of product form it is known that the variance of a single coordinate of the proposal in RWM (Random walk Metropolis) and MALA (Metropolis adjusted Langevin algorithm) should optimally scale as n^-1 and as n^-1/3 with dimension n, and that the acceptance rates should be tuned to 0.234 and 0.574. We establish counterexamples to demonstrate that smoothness assumptions such as C^1(R) for RWM and C^3(R) for MALA are indeed required if these guidelines are to hold. The counterexamples identify classes of marginal targets (obtained by perturbing a standard Normal density at the level of the potential (or second derivative of the potential for MALA) by a path of fractional Brownian motion with Hurst exponent H) for which these guidelines are violated. For such targets there is strong evidence that RWM and MALA proposal variances should optimally be scaled as n^-1/H and as n^-1/2+H and will then obey anomalous acceptance rate guidelines. Useful heuristics resulting from this theory are discussed. The paper develops a framework capable of tackling optimal scaling results for quite general Metropolis-Hastings algorithms (possibly depending on a random environment).

READ FULL TEXT
research
04/13/2021

Optimal scaling of random walk Metropolis algorithms using Bayesian large-sample asymptotics

High-dimensional limit theorems have been shown to be useful to derive t...
research
12/23/2014

Particle Metropolis-adjusted Langevin algorithms

This paper proposes a new sampling scheme based on Langevin dynamics tha...
research
08/09/2018

Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities?

Hamiltonian Monte Carlo (HMC) is a very popular and generic collection o...
research
01/06/2023

Optimal Scaling Results for a Wide Class of Proximal MALA Algorithms

We consider a recently proposed class of MCMC methods which uses proximi...
research
02/18/2019

Optimal Scaling and Shaping of Random Walk Metropolis via Diffusion Limits of Block-I.I.D. Targets

This work extends Roberts et al. (1997) by considering limits of Random ...
research
04/27/2019

Optimal Scaling of Metropolis Algorithms on General Target Distributions

The main limitation of the existing optimal scaling results for Metropol...
research
01/04/2022

Optimal design of the Barker proposal and other locally-balanced Metropolis-Hastings algorithms

We study the class of first-order locally-balanced Metropolis–Hastings a...

Please sign up or login with your details

Forgot password? Click here to reset