STLGPRCOMLOct 8, 2019

Variance reduction for Markov chains with application to MCMC

arXiv:1910.03643v230 citations
AI Analysis

This work addresses variance reduction in MCMC methods for Bayesian estimation, offering improvements over existing approaches, though it appears incremental in nature.

The authors tackled the problem of reducing variance in additive functionals of Markov chains, particularly for MCMC Bayesian estimation, by proposing a novel variance reduction approach based on control variates, which significantly reduces finite sample variance as demonstrated through theoretical analysis and simulations.

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.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes