Zero Variance Differential Geometric Markov Chain Monte Carlo Algorithms

By Theodore Papamarkou, Antonietta Mira, Mark A. Girolami. 2014

37 citations recorded by the source corpus.

Differential geometric Markov Chain Monte Carlo (MCMC) strategies exploit the geometry of the target to achieve convergence in fewer MCMC iterations at the cost of increased computing time for each of the iterations. Such computational complexity is regarded as a potential shortcoming of geometric MCMC in practice. This paper suggests that part of the additional computing required by Hamiltonian Monte Carlo and Metropolis adjusted Langevin algorithms produces elements that allow concurrent implementation of the zero variance reduction technique for MCMC estimation. Therefore, zero variance geometric MCMC emerges as an inherently unified sampling scheme, in the sense that variance reduction and geometric exploitation of the parameter space can be performed simultaneously without exceeding the computational requirements posed by the geometric MCMC scheme alone. A MATLAB package is provided, which implements a generic code framework of the combined methodology for a range of models.

Subfields: Artificial Intelligence, 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. Mark A. Girolami
  3. Theodore Papamarkou
  4. Nicolas Chopin
  5. Antonietta Mira
  6. Nial Friel
  7. Paul Fearnhead
  8. Andrew Gelman

In Statistics and Probability

  1. Chris J. Oates
  2. Mark A. Girolami
  3. Theodore Papamarkou
  4. Nicolas Chopin
  5. Nial Friel
  6. Antonietta Mira
  7. Qiang Liu
  8. Andrew Gelman

Citations in the corpus