Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms
arXiv:1403.3950 · doi:10.1214/14-AAP1083
Abstract
We consider whether ergodic Markov chains with bounded step size remain bounded in probability when their transitions are modified by an adversary on a bounded subset. We provide counterexamples to show that the answer is no in general, and prove theorems to show that the answer is yes under various additional assumptions. We then use our results to prove convergence of various adaptive Markov chain Monte Carlo algorithms.
arXiv commentPublished at http://dx.doi.org/10.1214/14-AAP1083 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (6)
- MCMC using Hamiltonian dynamics
- General state space Markov chains and MCMC algorithms
- On the ergodicity properties of some adaptive MCMC algorithms
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
- Adaptive Gibbs samplers and related MCMC methods
- A Mixture-Based Approach to Regional Adaptation for MCMC