# A Dirichlet Form approach to MCMC Optimal Scaling

@article{Zanella2016ADF, title={A Dirichlet Form approach to MCMC Optimal Scaling}, author={Giacomo Zanella and Wilfrid S. Kendall and Mylene B'edard}, journal={arXiv: Probability}, year={2016}, pages={4053-4082} }

This paper develops the use of Dirichlet forms to deliver proofs of optimal scaling results for Markov chain Monte Carlo algorithms (specifically, Metropolis-Hastings random walk samplers) under regularity conditions which are substantially weaker than those required by the original approach (based on the use of infinitesimal generators). The Dirichlet form methods have the added advantage of providing an explicit construction of the underlying infinite-dimensional context. In particular, this… Expand

#### 6 Citations

Optimal scaling of random-walk metropolis algorithms on general target distributions

- Mathematics
- 2019

One main limitation of the existing optimal scaling results for Metropolis--Hastings algorithms is that the assumptions on the target distribution are unrealistic. In this paper, we consider optimal… Expand

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

- Mathematics
- 2019

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… Expand

Sampling from rough energy landscapes

- Mathematics
- Communications in Mathematical Sciences
- 2020

We examine challenges to sampling from Boltzmann distributions associated with multiscale energy landscapes. The multiscale features, or "roughness," corresponds to highly oscillatory, but bounded,… Expand

Efficiency of delayed-acceptance random walk Metropolis algorithms

- Mathematics
- The Annals of Statistics
- 2021

Delayed-acceptance Metropolis-Hastings and delayed-acceptance pseudo-marginal Metropolis-Hastings algorithms can be applied when it is computationally expensive to calculate the true posterior or an… Expand

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

- Mathematics
- 2020

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)… Expand

Optimal Scaling of MCMC Beyond Metropolis

- Mathematics
- 2021

The problem of optimally scaling the proposal distribution in a Markov chain Monte Carlo algorithm is critical to the quality of the generated samples. Much work has gone into obtaining such results… Expand

#### References

SHOWING 1-10 OF 36 REFERENCES

Optimal scaling of the random walk Metropolis algorithm under L p mean differentiability

- Mathematics, Computer Science
- J. Appl. Probab.
- 2017

The main result is the weak convergence of the Markov chain to a Langevin diffusion process as the dimension d goes to infinity, because the log-density might be non-differentiable, the limiting diffusion could be singular. Expand

Complexity Bounds for MCMC via Diffusion Limits

- Mathematics
- 2014

We connect known results about diusion limits of Markov chain Monte Carlo (MCMC) algorithms to the computer science notion of algorithm complexity. Our main result states that any weak limit of a… Expand

Optimal scaling of discrete approximations to Langevin diffusions

- Mathematics
- 1998

We consider the optimal scaling problem for proposal distributions in Hastings–Metropolis algorithms derived from Langevin diffusions. We prove an asymptotic diffusion limit theorem and show that the… Expand

Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits

- Computer Science, Mathematics
- Journal of Applied Probability
- 2016

It is proved that under appropriate assumptions, the random-walk Metropolis algorithm in d dimensions takes O(d) iterations to converge to stationarity, while the Metropolis-adjusted Langevin algorithm takes O (d1/3) iterations. Expand

Weak convergence and optimal scaling of random walk Metropolis algorithms

- Mathematics
- 1997

This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm in order to maximize the efficiency of the algorithm. The main result is a… Expand

Optimal scaling of random walk Metropolis algorithms with discontinuous target densities

- Mathematics
- 2012

We consider the optimal scaling problem for high-dimensional random walk Metropolis (RWM) algorithms where the target distribution has a discontinuous probability density function. Almost all… Expand

Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms

- Mathematics
- 1996

We develop results on geometric ergodicity of Markov chains and apply these and other recent results in Markov chain theory to multidimensional Hastings and Metropolis algorithms. For those based on… Expand

Weak convergence of Metropolis algorithms for non-i.i.d. target distributions

- Mathematics
- 2007

In this paper, we shall optimize the efficiency of Metropolis algorithms for multidimensional target distributions with scaling terms possibly depending on the dimension. We propose a method for… Expand

Diffusion limits of the random walk metropolis algorithm in high dimensions

- Mathematics
- 2012

Diffusion limits of MCMC methods in high dimensions provide a useful theoretical tool for studying computational complexity. In particular, they lead directly to precise estimates of the number of… Expand

OPTIMAL SCALING FOR PARTIALLY UPDATING MCMC ALGORITHMS

- Mathematics
- 2006

In this paper we shall consider optimal scaling problems for high-dimensional Metropolis–Hastings algorithms where updates can be chosen to be lower dimensional than the target density itself. We… Expand