Efficiency of delayed-acceptance random walk metropolis algorithms
From MaRDI portal
Publication:2054541
Abstract: 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 unbiased stochastic approximation thereof, but a computationally cheap deterministic approximation is available. An initial accept-reject stage uses the cheap approximation for computing the Metropolis-Hastings ratio; proposals which are accepted at this stage are then subjected to a further accept-reject step which corrects for the error in the approximation. Since the expensive posterior, or the approximation thereof, is only evaluated for proposals which are accepted at the first stage, the cost of the algorithm is reduced and larger scalings may be used. We focus on the random walk Metropolis (RWM) and consider the delayed-acceptance RWM and the delayed-acceptance pseudo-marginal RWM. We provide a framework for incorporating relatively general deterministic approximations into the theoretical analysis of high-dimensional targets. Justified by diffusion approximation arguments, we derive expressions for the limiting efficiency and acceptance rates in high-dimensional settings. These theoretical insights are finally leveraged to formulate practical guidelines for the efficient tuning of the algorithms. The robustness of these guidelines and predicted properties are verified against simulation studies, all of which are strictly outside of the domain of validity of our limit results.
Recommendations
Cites work
- scientific article; zbMATH DE number 2106098 (Why is no real title available?)
- scientific article; zbMATH DE number 840151 (Why is no real title available?)
- A Dirichlet form approach to MCMC optimal scaling
- A lognormal central limit theorem for particle approximations of normalizing constants
- Adaptively scaling the Metropolis algorithm using expected squared jumped distance
- An Exact Gibbs Sampler for the Markov-Modulated Poisson Process
- Bayesian interference based only on simulated likelihood particle filter analysis of dynamic economic models
- Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits
- Delayed acceptance particle MCMC for exact inference in stochastic kinetic models
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
- Handbook of Markov Chain Monte Carlo
- Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance
- Importance sampling type estimators based on approximate marginal Markov chain Monte Carlo
- Inverse problems: a Bayesian perspective
- Large-sample asymptotics of the pseudo-marginal method
- Minimising MCMC variance via diffusion limits, with an application to simulated tempering
- Monte Carlo strategies in scientific computing
- On some properties of Markov chain Monte Carlo simulation methods based on the particle filter
- On the efficiency of pseudo-marginal random walk Metropolis algorithms
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Optimal scaling for the pseudo-marginal random walk Metropolis: insensitivity to the noise generating mechanism
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scaling of MaLa for nonlinear regression.
- Optimal scaling of Metropolis algorithms: Heading toward general target distributions
- Optimal scaling of random-walk Metropolis algorithms on general target distributions
- 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 scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
- Particle Markov Chain Monte Carlo Methods
- Posterior exploration for computationally intensive forward models
- Preconditioning Markov Chain Monte Carlo Simulations Using Coarse-Scale Models
- Pseudo-marginal Metropolis–Hastings sampling using averages of unbiased estimators
- Scaling analysis of multiple-try MCMC methods
- Speeding up MCMC by Delayed Acceptance and Data Subsampling
- Statistical and computational inverse problems.
- The pseudo-marginal approach for efficient Monte Carlo computations
- The random walk Metropolis: linking theory and practice through a case study
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
Cited in
(9)- Accelerating sequential Monte Carlo with surrogate likelihoods
- Variance bounding of delayed-acceptance kernels
- Accelerating inference for stochastic kinetic models
- Multilevel Delayed Acceptance MCMC
- Efficient sequential Monte Carlo algorithms for integrated population models
- Optimal scaling of MCMC beyond Metropolis
- Scaling analysis of delayed rejection MCMC methods
- Emulation-accelerated Hamiltonian Monte Carlo algorithms for parameter estimation and uncertainty quantification in differential equation models
- On Metropolis-Hastings algorithms with delayed rejection
This page was built for publication: Efficiency of delayed-acceptance random walk metropolis algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2054541)
