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

02/18/2019
by   Jeffrey Negrea, et al.
0

This work extends Roberts et al. (1997) by considering limits of Random Walk Metropolis (RWM) applied to block IID target distributions, with corresponding block-independent proposals. The extension verifies the robustness of the optimal scaling heuristic, to tune the acceptance rate to ≈0.234, for any choice of proposal shaping. We upgrade the form of weak convergence from a finite-dimensional subprocess to the infinite dimensional process. We show that the optimal shaping (in terms of the decay of autocorrelations of linear functions) is the variance of the target distribution. We show that this choice coincides with the optimal shaping in terms of spectral gaps in special cases where they can be computed. Lastly, we provide some negative guarantees, showing that RWM performance degrades with higher-order dependence. In such cases, no tuning of RWM will yield performance comparable to an IID target.

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
04/27/2019

Optimal Scaling of Metropolis Algorithms on General Target Distributions

The main limitation of the existing optimal scaling results for Metropol...
research
09/16/2022

Optimal Scaling for Locally Balanced Proposals in Discrete Spaces

Optimal scaling has been well studied for Metropolis-Hastings (M-H) algo...
research
02/24/2022

Robust random walk-like Metropolis-Hastings algorithms for concentrating posteriors

Motivated by Bayesian inference with highly informative data we analyze ...
research
08/30/2018

Maximum likelihood estimator and its consistency for an (L,1) random walk in a parametric random environment

Consider an (L,1) random walk in an i.i.d. random environment, whose env...
research
10/21/2019

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

For sufficiently smooth targets of product form it is known that the var...
research
12/19/2014

Random Walk Initialization for Training Very Deep Feedforward Networks

Training very deep networks is an important open problem in machine lear...

Please sign up or login with your details

Forgot password? Click here to reset