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

From MaRDI portal
Publication:2467602


DOI10.1214/105051607000000096zbMath1144.60016arXiv0710.3684MaRDI 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


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



Cites Work