Optimal scaling of MCMC beyond Metropolis
From MaRDI portal
Abstract: 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 for various Metropolis-Hastings (MH) algorithms. Recently, acceptance probabilities other than MH are being employed in problems with intractable target distributions. There is little resource available on tuning the Gaussian proposal distributions for this situation. We obtain optimal scaling results for a general class of acceptance functions, which includes Barker's and Lazy-MH. In particular, optimal values for the Barker's algorithm are derived and found to be significantly different from that obtained for the MH algorithm. Our theoretical conclusions are supported by numerical simulations indicating that when the optimal proposal variance is unknown, tuning to the optimal acceptance probability remains an effective strategy.
Recommendations
- Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scaling of Metropolis algorithms: Heading toward general target distributions
- Optimal scaling of random walk Metropolis algorithms using Bayesian large-sample asymptotics
- A Dirichlet form approach to MCMC optimal scaling
- Optimal scaling of random-walk Metropolis algorithms on general target distributions
- Optimal scaling of random walk Metropolis algorithms with non-Gaussian proposals
- Optimal scaling for partially updating MCMC algorithms
- Scaling analysis of multiple-try MCMC methods
Cites work
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- A Dirichlet form approach to MCMC optimal scaling
- A geometric interpretation of the Metropolis-Hastings algorithm.
- Barker's algorithm for Bayesian inference with intractable likelihoods
- CLTs and asymptotic variance of time-sampled Markov chains
- Diffusion limit for the random walk Metropolis algorithm out of stationarity
- Does waste recycling really improve the multi-proposal Metropolis-Hastings algorithm? An analysis based on control variates
- Efficiency of delayed-acceptance random walk metropolis algorithms
- Efficient Bernoulli factory Markov chain Monte Carlo for intractable posteriors
- Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
- Equation of state calculations by fast computing machines
- Exponential convergence of Langevin distributions and their discrete approximations
- From the Bernoulli factory to a dice enterprise via perfect sampling of Markov chains
- Handbook of Markov Chain Monte Carlo
- Large-sample asymptotics of the pseudo-marginal method
- Markov chains and stochastic stability
- Monte Carlo sampling methods using Markov chains and their applications
- Multivariate output analysis for Markov chain Monte Carlo
- On Metropolis-Hastings algorithms with delayed rejection
- On the efficiency of pseudo-marginal random walk Metropolis algorithms
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234
- Optimal scaling for partially updating MCMC algorithms
- Optimal scaling for the transient phase of Metropolis Hastings algorithms: the longtime behavior
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scaling of random walk Metropolis algorithms using Bayesian large-sample asymptotics
- Optimal scaling of random-walk Metropolis algorithms on general target distributions
- Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets
- Optimal search efficiency of Barker's algorithm with an exponential fitness function
- Optimum Monte-Carlo sampling using Markov chains
- Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
- Weak convergence and optimal scaling of random walk Metropolis algorithms
Cited in
(19)- Scaling analysis of delayed rejection MCMC methods
- Collective proposal distributions for nonlinear MCMC samplers: mean-field theory and fast implementation
- Lower bounds on the rate of convergence for accept-reject-based Markov chains in Wasserstein and total variation distances
- Optimal scaling results for Moreau-Yosida Metropolis-adjusted Langevin algorithms
- Optimal volume-corrected Laplace-Metropolis method
- A fresh Take on ‘Barker Dynamics’ for MCMC
- A brief review of optimal scaling of the main MCMC approaches and optimal scaling of additive TMCMC under non-regular cases
- Optimal estimation versus MCMC for CO\(_2\) retrievals
- Optimal proposal distributions and adaptive MCMC
- Hierarchical models: local proposal variances for RWM-within-Gibbs and MALA-within-Gibbs
- Conditional sequential Monte Carlo in high dimensions
- Optimal scaling of random walk Metropolis algorithms with non-Gaussian proposals
- A brief tutorial on transformation based Markov chain Monte Carlo and optimal scaling of the additive transformation
- Tuning diagonal scale matrices for HMC
- A Dirichlet form approach to MCMC optimal scaling
- Optimal scaling of the independence sampler: theory and practice
- Optimal search efficiency of Barker's algorithm with an exponential fitness function
- Optimal scaling for partially updating MCMC algorithms
- Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo
This page was built for publication: Optimal scaling of MCMC beyond Metropolis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159395)
