Control variates and Rao-Blackwellization for deterministic sweep Markov chains

12/14/2019
by   Stephen Berg, et al.
0

We study control variate methods for Markov chain Monte Carlo (MCMC) in the setting of deterministic sweep sampling using K≥ 2 transition kernels. New variance reduction results are provided for MCMC averages based on sweeps over general transition kernels, leading to a particularly simple control variate estimator in the setting of deterministic sweep Gibbs sampling. Theoretical comparisons of our proposed control variate estimators with existing literature are made, and a simulation study is performed to examine the amount of variance reduction in some example cases. We also relate control variate approaches to approaches based on conditioning (or Rao-Blackwellization), and show that the latter can be viewed as an approximation of the former. Our theoretical results hold for Markov chains under standard geometric drift assumptions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2023

Theoretical guarantees for neural control variates in MCMC

In this paper, we propose a variance reduction approach for Markov chain...
research
10/08/2019

Variance reduction for Markov chains with application to MCMC

In this paper we propose a novel variance reduction approach for additiv...
research
04/06/2022

Markov cohort state-transition model: A multinomial distribution representation

Markov cohort state-transition models have been the standard approach fo...
research
08/17/2019

Prune Sampling: a MCMC inference technique for discrete and deterministic Bayesian networks

We introduce and characterise the performance of the Markov chain Monte ...
research
05/22/2019

Application of the interacting particle system method to piecewise deterministic Markov processes used in reliability

Variance reduction methods are often needed for the reliability assessme...
research
06/20/2022

Mobility estimation for Langevin dynamics using control variates

The scaling of the mobility of two-dimensional Langevin dynamics in a pe...
research
03/21/2022

DBSOP: An Efficient Heuristic for Speedy MCMC Sampling on Polytopes

Markov Chain Monte Carlo (MCMC) techniques have long been studied in com...

Please sign up or login with your details

Forgot password? Click here to reset