A vanilla Rao--Blackwellization of Metropolis--Hastings algorithms

By Randal Douc, Christian P. Robert. 2009

46 citations recorded by the source corpus.

Casella and Robert (1996) presented a general Rao--Blackwellisation principle for accept-reject and Metropolis-Hastings schemes that leads to significant decreases in the variance of the resulting estimators, but at a high cost in computing and storage. Adopting a completely different perspective, we introduce instead a universal scheme that guarantees variance reductions in all Metropolis-Hastings~based estimators while keeping the computing cost under control. We establish a central limit theorems for the improved estimators and illustrate their performances on toy examples.

Subfields: Artificial Intelligence, Management Science and Operations Research, Statistics and Probability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Chris J. Oates
  2. Nicolas Chopin
  3. Marcelo Pereyra
  4. Christian P. Robert
  5. Peter J. Green
  6. Mark A. Girolami
  7. K. Latuszy'nski
  8. Gael M. Martin

In Management Science and Operations Research

  1. Chris J. Oates
  2. Florian Huber
  3. Nicolas Chopin
  4. John M. Maheu
  5. Ruben Loaiza-Maya
  6. Gael M. Martin
  7. Anastasios Panagiotelis
  8. Didier Nibbering

In Statistics and Probability

  1. Chris J. Oates
  2. Mark A. Girolami
  3. Nicolas Chopin
  4. Peter J. Green
  5. Marcelo Pereyra
  6. Christian P. Robert
  7. K. Latuszy'nski
  8. Gael M. Martin

Citations in the corpus