Variance reduction for dependent sequences with applications to stochastic gradient mcmc

  • Denis Belomestny
  • , Leonid Iosipoi
  • , Eric Moulines
  • , Alexey Naumov
  • , Sergey Samsonov

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper we propose a novel and practical variance reduction approach for additive functionals of dependent sequences. Our approach combines the use of control variates with the minimization of an empirical variance estimate. We analyze finite sample properties of the proposed method and derive finite-Time bounds of the excess asymptotic variance to zero. We apply our methodology to stochastic gradient Markov chain Monte Carlo (SGMCMC) methods for Bayesian inference on large data sets and combine it with existing variance reduction methods for SGMCMC. We present empirical results carried out on a number of benchmark examples showing that our variance reduction method achieves significant improvement as compared to state-of-The-Art methods at the expense of a moderate increase of computational overhead.

Original languageEnglish
Pages (from-to)507-535
Number of pages29
JournalCiencia Tecnologia Agropecuaria
Volume22
Issue number1
DOIs
Publication statusPublished - 1 Apr 2021

Keywords

  • Generative models
  • Mcmc algorithms
  • Stochastic gradient
  • Variance reduction

Fingerprint

Dive into the research topics of 'Variance reduction for dependent sequences with applications to stochastic gradient mcmc'. Together they form a unique fingerprint.

Cite this