Variance reduction for Markov chains with application to MCMC

  • D. Belomestny
  • , L. Iosipoi
  • , E. Moulines
  • , A. Naumov
  • , S. Samsonov

Research output: Contribution to journalArticlepeer-review

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 favorably compares to the existing variance reduction approaches.

Original languageEnglish
Pages (from-to)973-997
Number of pages25
JournalStatistics and Computing
Volume30
Issue number4
DOIs
Publication statusPublished - 1 Jul 2020

Keywords

  • Empirical spectral variance minimization
  • Markov chain Monte Carlo
  • Metropolis-adjusted Langevin algorithm
  • Random walk metropolis
  • Stein’s control variates
  • Unadjusted Langevin algorithm
  • Variance reduction

Fingerprint

Dive into the research topics of 'Variance reduction for Markov chains with application to MCMC'. Together they form a unique fingerprint.

Cite this