Convergence of adaptive and interacting Markov chain Monte Carlo algorithms

DOI10.1214/11-AOS938MaRDI QIDQ449997zbMATH OpenOpenAlexFDO

Authors Gersende Fort, Eric Moulines, P. Priouret

Publication date 3 September 2012

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.3036, https://projecteuclid.org/euclid.aos/1330958679

zbMATH Keywords

Markov chain Monte Carloadaptive Monte Carloequi-energy samplerparallel temperingMarkov chainslaw of large numbersergodic theoremsadaptive metropolisinteracting tempering

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Sequential statistical analysis (62L10) Central limit and other weak theorems (60F05) Discrete-time Markov processes on general state spaces (60J05) Stochastic learning and adaptive control (93E35)

Abstract: Adaptive and interacting Markov chain Monte Carlo algorithms (MCMC) have been recently introduced in the literature. These novel simulation algorithms are designed to increase the simulation efficiency to sample complex distributions. Motivated by some recently introduced algorithms (such as the adaptive Metropolis algorithm and the interacting tempering algorithm), we develop a general methodological and theoretical framework to establish both the convergence of the marginal distribution and a strong law of large numbers. This framework weakens the conditions introduced in the pioneering paper by Roberts and Rosenthal [J. Appl. Probab. 44 (2007) 458--475]. It also covers the case when the target distribution $pi$ is sampled by using Markov transition kernels with a stationary distribution that differs from $pi$.

Recommendations

• A central limit theorem for adaptive and interacting Markov chains
• On the convergence rates of some adaptive Markov chain Monte Carlo algorithms
• Interacting Hastings-Metropolis algorithms
• On the ergodicity properties of some adaptive MCMC algorithms
• Markov Chain Monte Carlo Algorithms: Theory and Practice

Cites work

• scientific article; zbMATH DE number 3678541 (Why is no real title available?)
• scientific article; zbMATH DE number 3723610 (Why is no real title available?)
• scientific article; zbMATH DE number 1354815 (Why is no real title available?)
• scientific article; zbMATH DE number 2117879 (Why is no real title available?)
• A Note on Convergence of the Equi-Energy Sampler
• A cautionary tale on the efficiency of some adaptive Monte Carlo schemes
• A functional central limit theorem for a class of interacting Markov chain Monte Carlo methods
• Adaptive proposal distribution for random walk Metropolis algorithm
• An adaptive Metropolis algorithm
• Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
• Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
• Discussion of ``Equi-energy sampler by Kou, Zhou and Wong
• Equi-energy sampler with applications in statistical inference and statistical mechanics
• General state space Markov chains and MCMC algorithms
• Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
• Geometric ergodicity of Metropolis algorithms
• Limit theorems for some adaptive MCMC algorithms with subgeometric kernels
• Markov Chain Monte Carlo Methods for High Dimensional Inversion in Remote Sensing
• Markov Chains and Stochastic Stability
• Non-linear Markov Chain Monte Carlo
• On adaptive Markov chain Monte Carlo algorithms
• On nonlinear Markov chain Monte Carlo
• On the containment condition for adaptive Markov chain Monte Carlo algorithms
• On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
• On the ergodicity properties of some adaptive MCMC algorithms
• Optimal proposal distributions and adaptive MCMC
• Polynomial ergodicity of Markov transition kernels.
• Quantitative bounds on convergence of time-inhomogeneous Markov chains
• Rates of convergence of the Hastings and Metropolis algorithms
• Real Analysis and Probability
• Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
• Sequentially interacting Markov chain Monte Carlo methods
• Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo

Cited in

(49)

• Computation for latent variable model estimation: a unified stochastic proximal framework
• Quantitative convergence rates for subgeometric Markov chains
• Adaptive MCMC with online relabeling
• A central limit theorem for adaptive and interacting Markov chains
• Adaptive Incremental Mixture Markov Chain Monte Carlo
• Markov Kernels Local Aggregation for Noise Vanishing Distribution Sampling
• Posterior inference on parameters of stochastic differential equations via non-linear Gaussian filtering and adaptive MCMC
• On the convergence rates of some adaptive Markov chain Monte Carlo algorithms
• Weak Convergence Rates of Population Versus Single-Chain Stochastic Approximation MCMC Algorithms
• Adaptive Metropolis algorithm using variational Bayesian adaptive Kalman filter
• A multiresolution method for parameter estimation of diffusion processes
• Adapting the Number of Particles in Sequential Monte Carlo Methods Through an Online Scheme for Convergence Assessment
• A subsampling approach for Bayesian model selection
• A note on formal constructions of sequential conditional couplings
• Convergence rates of attractive-repulsive MCMC algorithms
• Minimising MCMC variance via diffusion limits, with an application to simulated tempering
• Interacting Markov chain Monte Carlo methods for solving nonlinear measure-valued equations
• Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization
• Bayesian computation: a summary of the current state, and samples backwards and forwards
• Automatically tuned general-purpose MCMC via new adaptive diagnostics
• Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
• Adaptive Gibbs samplers and related MCMC methods
• Central limit theorems for stochastic approximation with controlled Markov chain dynamics
• Convergence and efficiency of adaptive importance sampling techniques with partial biasing
• Convergence of the Wang-Landau algorithm
• Accelerated dimension-independent adaptive metropolis
• Parallel and interacting Markov chain Monte Carlo algorithm
• Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms
• Stochastic adaptive selection of weights in the simulated tempering algorithm
• Statistical estimation of a growth-fragmentation model observed on a genealogical tree
• Convergence control methods for Markov chain Monte Carlo algorithms
• Convergence of Markovian stochastic approximation with discontinuous dynamics
• Adaptive schemes for piecewise deterministic Monte Carlo algorithms
• Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation
• On nonlinear Markov chain Monte Carlo
• Ergodicity of combocontinuous adaptive MCMC algorithms
• A framework for adaptive MCMC targeting multimodal distributions
• Interacting multiple try algorithms with different proposal distributions
• The containment condition and AdapFail algorithms
• scientific article; zbMATH DE number 5520724 (Why is no real title available?)
• Studying Convergence of Markov Chain Monte Carlo Algorithms Using Coupled Sample Paths
• Adaptive random neighbourhood informed Markov chain Monte Carlo for high-dimensional Bayesian variable selection
• Stochastic proximal-gradient algorithms for penalized mixed models
• Adaptive Markov chain Monte Carlo for auxiliary variable method and its application to parallel tempering
• Parallel tempering with equi-energy moves
• Self-healing umbrella sampling: convergence and efficiency
• On adaptive Markov chain Monte Carlo algorithms
• The Wang-Landau algorithm reaches the flat histogram criterion in finite time
• Adaptive Component-Wise Multiple-Try Metropolis Sampling

This page was built for publication: Convergence of adaptive and interacting Markov chain Monte Carlo algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449997)