Optimal scaling of Metropolis algorithms: Heading toward general target distributions

DOI10.1002/cjs.5550360401zbMath1167.60344MaRDI QIDQ3626373

Jeffrey S. Rosenthal, Mylène Bédard

Publication date: 22 May 2009

Published in: Canadian Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cjs.5550360401

Mathematics Subject Classification ID

60J22: Computational methods in Markov chains

60F05: Central limit and other weak theorems

65C40: Numerical analysis or methods applied to Markov chains

Related Items

Optimal scaling of the random walk Metropolis algorithm under L^p mean differentiability, Interacting Langevin Diffusions: Gradient Structure and Ensemble Kalman Sampler, Asymptotic variance for random walk Metropolis chains in high dimensions: logarithmic growth via the Poisson equation, Component-wise Markov chain Monte Carlo: uniform and geometric ergodicity under mixing and composition, Skew brownian motion and complexity of the alps algorithm, A large deviation principle for the empirical measures of Metropolis-Hastings chains, Parallel hierarchical sampling: a general-purpose interacting Markov chains Monte Carlo algorithm, Asymptotic analysis of the random walk metropolis algorithm on ridged densities, Efficiency of delayed-acceptance random walk metropolis algorithms, Large deviations for the empirical measure of the zig-zag process, An adaptive multiple-try Metropolis algorithm, Optimal scaling of random-walk Metropolis algorithms on general target distributions, Deterministic and stochastic damage detection via dynamic response analysis, Weight-preserving simulated tempering, Non-stationary phase of the MALA algorithm, On the efficiency of pseudo-marginal random walk Metropolis 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, Scaling analysis of delayed rejection MCMC methods, On the empirical efficiency of local MCMC algorithms with pools of proposals, Model Uncertainty in Claims Reserving within Tweedie's Compound Poisson Models

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal scaling of random walk Metropolis algorithms with discontinuous target densities
• Optimal scaling for partially updating MCMC algorithms
• Weak convergence and optimal scaling of random walk Metropolis algorithms
• Optimal scaling for various Metropolis-Hastings algorithms.
• Bayesian computation and stochastic systems. With comments and reply.
• On Metropolis-Hastings algorithms with delayed rejection
• From Metropolis to diffusions: Gibbs states and optimal scaling.
• General Irreducible Markov Chains and Non-Negative Operators
• Optimal Scaling of Discrete Approximations to Langevin Diffusions
• The Multiple-Try Method and Local Optimization in Metropolis Sampling
• Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
• Monte Carlo sampling methods using Markov chains and their applications