On the efficiency of pseudo-marginal random walk Metropolis algorithms
DOI10.1214/14-AOS1278zbMath1326.65015arXiv1309.7209OpenAlexW2003456014WikidataQ61434481 ScholiaQ61434481MaRDI QIDQ2338926
Jeffrey S. Rosenthal, Gareth O. Roberts, Chris Sherlock, Alexandre H. Thiery
Publication date: 27 March 2015
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.7209
Markov chain Monte Carlo methodefficiencyoptimal scalingdiffusion limitpseudo-marginal random walk Metropolis-Hastings algorithmtarget density
Computational methods in Markov chains (60J22) Central limit and other weak theorems (60F05) Monte Carlo methods (65C05) Sums of independent random variables; random walks (60G50) Discrete-time Markov processes on general state spaces (60J05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Particle approximations of the score and observed information matrix in state space models with application to parameter estimation
- The pseudo-marginal approach for efficient Monte Carlo computations
- On some properties of Markov chain Monte Carlo simulation methods based on the particle filter
- Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets
- The random walk Metropolis: linking theory and practice through a case study
- 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.
- Optimal scaling of MaLa for nonlinear regression.
- Markov chains for exploring posterior distributions. (With discussion)
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Rejoinder on: Sequences of regressions and their independences
- Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
- Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
- Minimising MCMC variance via diffusion limits, with an application to simulated tempering
- Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
- A lognormal central limit theorem for particle approximations of normalizing constants
- Particle Markov Chain Monte Carlo for Efficient Numerical Simulation
- Handbook of Markov Chain Monte Carlo
- Optimal scaling of Metropolis algorithms: Heading toward general target distributions
- Particle Filters for Partially Observed Diffusions
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Optimal Scaling of the Random Walk Metropolis: General Criteria for the 0.234 Acceptance Rule
- Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator