Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets

DOI10.3150/08-BEJ176zbMath1215.60047arXiv0909.0856OpenAlexW2119516689WikidataQ61434495 ScholiaQ61434495MaRDI QIDQ605022

Gareth O. Roberts, Chris Sherlock

Publication date: 12 November 2010

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.0856

zbMATH Keywords

optimal scalingrandom walk Metropolisoptimal acceptance rate

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)

Related Items

A Mode-Jumping Algorithm for Bayesian Factor Analysis, Optimal scaling of random walk Metropolis algorithms using Bayesian large-sample asymptotics, Information-geometric Markov chain Monte Carlo methods using diffusions, Designing simple and efficient Markov chain Monte Carlo proposal kernels, An adaptive multiple-try Metropolis algorithm, Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits, Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions, Hierarchical models: local proposal variances for RWM-within-Gibbs and MALA-within-Gibbs, A Dirichlet form approach to MCMC optimal scaling, A Benchmark for the Bayesian Inversion of Coefficients in Partial Differential Equations, Sampling Constrained Probability Distributions Using Spherical Augmentation, Conditional sequential Monte Carlo in high dimensions, Optimal scaling of random-walk Metropolis algorithms on general target distributions, Optimal scaling of MCMC beyond Metropolis, Wavelet Monte Carlo: a principle for sampling from complex distributions, The Apogee to Apogee Path Sampler, The random walk Metropolis: linking theory and practice through a case study, On the stability and ergodicity of adaptive scaling Metropolis algorithms, Simultaneous estimation of complementary moment independent and reliability-oriented sensitivity measures, Optimal scaling of random walk Metropolis algorithms with discontinuous target densities, Optimal Scaling of the Random Walk Metropolis: General Criteria for the 0.234 Acceptance Rule, Optimal scaling of the random walk Metropolis algorithm under L^p mean differentiability, Random walk Metropolis algorithm in high dimension with non-Gaussian target distributions, Efficiency of delayed-acceptance random walk metropolis algorithms, A class of spherical and elliptical distributions with Gaussian-like limit properties, On the efficiency of pseudo-marginal random walk Metropolis algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak convergence and optimal scaling of random walk Metropolis algorithms
• Optimal scaling for various Metropolis-Hastings algorithms.
• From Metropolis to diffusions: Gibbs states and optimal scaling.
• Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
• Optimal metropolis algorithms for product measures on the vertices of a hypercube