Weak convergence of Metropolis algorithms for non-I.I.D. target distributions

DOI10.1214/105051607000000096zbMath1144.60016arXiv0710.3684OpenAlexW3100216688MaRDI QIDQ2467602

Mylène Bédard

Publication date: 28 January 2008

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0710.3684

zbMATH Keywords

diffusionweak convergenceMarkov chain Monte CarloMetropolis algorithmoptimal scaling

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Numerical analysis or methods applied to Markov chains (65C40)

Related Items (40)

Asymptotic analysis of the random walk metropolis algorithm on ridged densities ⋮ Optimal scaling of random walk Metropolis algorithms using Bayesian large-sample asymptotics ⋮ An adaptive multiple-try Metropolis algorithm ⋮ Unnamed Item ⋮ Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits ⋮ Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions ⋮ Hierarchical models: local proposal variances for RWM-within-Gibbs and MALA-within-Gibbs ⋮ Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets ⋮ A Dirichlet form approach to MCMC optimal scaling ⋮ Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions ⋮ Interacting Langevin Diffusions: Gradient Structure and Ensemble Kalman Sampler ⋮ Optimal scaling of random-walk Metropolis algorithms on general target distributions ⋮ A hierarchical Bayesian approach for modeling the evolution of the 7-day moving average of the number of deaths by COVID-19 ⋮ The random walk Metropolis: linking theory and practice through a case study ⋮ Adaptive Gibbs samplers and related MCMC methods ⋮ Diffusion limits of the random walk Metropolis algorithm in high dimensions ⋮ Optimal tuning of the hybrid Monte Carlo algorithm ⋮ Minimising MCMC variance via diffusion limits, with an application to simulated tempering ⋮ Optimal scaling of random walk Metropolis algorithms with non-Gaussian proposals ⋮ Optimal scaling for the transient phase of Metropolis Hastings algorithms: the longtime behavior ⋮ Optimal scaling for random walk Metropolis on spherically constrained target densities ⋮ Weak convergence and optimal tuning of the reversible jump algorithm ⋮ Error Bounds and Normalising Constants for Sequential Monte Carlo Samplers in High Dimensions ⋮ Optimal scaling of random walk Metropolis algorithms with discontinuous target densities ⋮ Optimal Scaling of the Random Walk Metropolis: General Criteria for the 0.234 Acceptance Rule ⋮ Hierarchical models and tuning of random walk Metropolis algorithms ⋮ Optimal scaling of the random walk Metropolis algorithm under L^p mean differentiability ⋮ On the stability of sequential Monte Carlo methods in high dimensions ⋮ Asymptotic variance for random walk Metropolis chains in high dimensions: logarithmic growth via the Poisson equation ⋮ Bayesian computation: a summary of the current state, and samples backwards and forwards ⋮ Scaling analysis of delayed rejection MCMC methods ⋮ Random walk Metropolis algorithm in high dimension with non-Gaussian target distributions ⋮ Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234 ⋮ Efficiency of delayed-acceptance random walk metropolis algorithms ⋮ Non-stationary phase of the MALA algorithm ⋮ Scaling analysis of multiple-try MCMC methods ⋮ Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates ⋮ On the efficiency of pseudo-marginal random walk Metropolis algorithms ⋮ An automatic robust Bayesian approach to principal component regression ⋮ Optimal scaling for the transient phase of the random walk Metropolis algorithm: the mean-field limit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• General state space Markov chains and MCMC algorithms
• 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.
• From Metropolis to diffusions: Gibbs states and optimal scaling.
• Optimal scaling of MaLa for nonlinear regression.
• Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234
• Optimal Scaling of Discrete Approximations to Langevin Diffusions
• Monte Carlo sampling methods using Markov chains and their applications

This page was built for publication: Weak convergence of Metropolis algorithms for non-I.I.D. target distributions