# Fast Compression of MCMC Output

@article{Chopin2021FastCO, title={Fast Compression of MCMC Output}, author={Nicolas Chopin and Gabriel Ducrocq}, journal={Entropy}, year={2021}, volume={23} }

We propose cube thinning, a novel method for compressing the output of an MCMC (Markov chain Monte Carlo) algorithm when control variates are available. It allows resampling of the initial MCMC sample (according to weights derived from control variates), while imposing equality constraints on the averages of these control variates, using the cube method (an approach that originates from survey sampling). The main advantage of cube thinning is that its complexity does not depend on the size of… Expand

#### References

SHOWING 1-10 OF 26 REFERENCES

A fast algorithm for balanced sampling

- Computer Science
- Comput. Stat.
- 2006

This paper proposes a very fast implementation of the cube method, where the execution time does not depend on the square of the population size anymore, but only on the population Size. Expand

Diffusion approximations and control variates for MCMC

- Mathematics
- 2018

A new methodology is presented for the construction of control variates to reduce the variance of additive functionals of Markov Chain Monte Carlo (MCMC) samplers. Our control variates are defined as… Expand

Control Variates for the Metropolis–Hastings Algorithm

- Mathematics
- 2008

We propose new control variates for variance reduction in estimation of mean values using the Metropolis-Hastings algorithm. Traditionally, states that are rejected in the Metropolis-Hastings… Expand

Control functionals for Monte Carlo integration

- Mathematics
- 2014

Summary
A non-parametric extension of control variates is presented. These leverage gradient information on the sampling density to achieve substantial variance reduction. It is not required that… Expand

Markov Chain Monte Carlo conver-gence diagnostics: a comparative review

- Mathematics, Computer Science
- 1994

All of the methods in this work can fail to detect the sorts of convergence failure that they were designed to identify, so a combination of strategies aimed at evaluating and accelerating MCMC sampler convergence are recommended. Expand

Control variates for estimation based on reversible Markov chain Monte Carlo samplers

- Mathematics
- 2012

Summary. A general methodology is introduced for the construction and effective application of control variates to estimation problems involving data from reversible Markov chain Monte Carlo… Expand

Practical Markov Chain Monte Carlo

- Computer Science
- 1992

The case is made for basing all inference on one long run of the Markov chain and estimating the Monte Carlo error by standard nonparametric methods well-known in the time-series and operations research literature. Expand

Efficient balanced sampling: The cube method

- Mathematics
- 2004

A balanced sampling design is defined by the property that the Horvitz--Thompson estimators of the population totals of a set of auxiliary variables equal the known totals of these variables.… Expand

On the Poisson equation for Metropolis-Hastings chains

- Mathematics
- 2015

This paper defines an approximation scheme for a solution of the Poisson equation of a geometrically ergodic Metropolis-Hastings chain $\Phi$. The approximations give rise to a natural sequence of… Expand

Zero variance Markov chain Monte Carlo for Bayesian estimators

- Mathematics, Computer Science
- Stat. Comput.
- 2013

A general purpose variance reduction technique for the MCMC estimator, based on the zero-variance principle introduced in the physics literature, is proposed, and conditions for asymptotic unbiasedness of the Zero Variance estimator are derived. Expand