Variance reduction for additive functionals of Markov chains via martingale representations

From MaRDI portal
Publication:2114045

DOI10.1007/S11222-021-10073-ZzbMATH Open1482.62003arXiv1903.07373OpenAlexW4210453183MaRDI QIDQ2114045FDOQ2114045

D. Belomestny, Eric Moulines, S. P. Samsonov

Publication date: 14 March 2022

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: In this paper we propose an efficient variance reduction approach for additive functionals of Markov chains relying on a novel discrete time martingale representation. Our approach is fully non-asymptotic and does not require the knowledge of the stationary distribution (and even any type of ergodicity) or specific structure of the underlying density. By rigorously analyzing the convergence properties of the proposed algorithm, we show that its cost-to-variance product is indeed smaller than one of the naive algorithm. The numerical performance of the new method is illustrated for the Langevin-type Markov Chain Monte Carlo (MCMC) methods.


Full work available at URL: https://arxiv.org/abs/1903.07373




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Variance reduction for additive functionals of Markov chains via martingale representations

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