Variance reduction for Markov chains with application to MCMC

Abstract

In this paper we propose a novel variance reduction approach for additive functionals of Markov chains based on minimization of an estimate for the asymptotic variance of these functionals over suitable classes of control variates. A distinctive feature of the proposed approach is its ability to significantly reduce the overall finite sample variance. This feature is theoretically demonstrated by means of a deep non asymptotic analysis of a variance reduced functional as well as by a thorough simulation study. In particular we apply our method to various MCMC Bayesian estimation problems where it favourably compares to the existing variance reduction approaches.

References in corpus (6)

• General state space Markov chains and MCMC algorithms
• Transportation cost-information inequalities and applications to random dynamical systems and diffusions
• Batch means and spectral variance estimators in Markov chain Monte Carlo
• Zero-variance principle for Monte Carlo algorithms
• Zero Variance Markov Chain Monte Carlo for Bayesian Estimators
• Diffusion approximations and control variates for MCMC