Scalable couplings for the random walk Metropolis algorithm

DOI10.1093/JRSSSB/QKAE113MaRDI QIDQ6911599zbMATH OpenFDO

Authors Tamás P. Papp, Chris Sherlock

Publication date 24 October 2025

Published in Journal of the Royal Statistical Society. Series B. Statistical Methodology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

Markov chain Monte Carlo methodsoptimal scalingcouplingsODE limit

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• A weakly informative default prior distribution for logistic and other regression models
• Asymptotic analysis of the random walk metropolis algorithm on ridged densities
• Bounding Wasserstein Distance with Couplings
• Coupling and convergence for Hamiltonian Monte Carlo
• Coupling methods for multidimensional diffusion processes
• Coupling-based convergence assessment of some Gibbs samplers for high-dimensional Bayesian regression with shrinkage priors
• Diffusion limit for the random walk Metropolis algorithm out of stationarity
• Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions
• Explicit convergence bounds for Metropolis Markov chains: isoperimetry, spectral gaps and profiles
• Gaussian Markov Random Fields
• Hug and hop: a discrete-time, nonreversible Markov chain Monte Carlo algorithm
• Leave Pima Indians alone: binary regression as a benchmark for Bayesian computation
• MCMC using Hamiltonian dynamics
• Metropolis-Hastings transition kernel couplings
• Monte Carlo strategies in scientific computing
• On a Formula for the L2 Wasserstein Metric between Measures on Euclidean and Hilbert Spaces
• Optimal Scaling of Discrete Approximations to Langevin Diffusions
• Optimal Transport
• Optimal scaling for various Metropolis-Hastings algorithms.
• Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets
• Optimal scaling of the random walk Metropolis: general criteria for the 0.234 acceptance rule
• Optimal tuning of the hybrid Monte Carlo algorithm
• Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
• The Barker Proposal: Combining Robustness and Efficiency in Gradient-Based MCMC
• The pseudo-marginal approach for efficient Monte Carlo computations
• Unbiased Hamiltonian Monte Carlo with couplings
• Unbiased Markov Chain Monte Carlo Methods with Couplings
• Unbiased Markov chain Monte Carlo for intractable target distributions
• Weak convergence and optimal scaling of random walk Metropolis algorithms

This page was built for publication: Scalable couplings for the random walk Metropolis algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911599)