Controlled MCMC for Optimal Sampling

  title={Controlled MCMC for Optimal Sampling},
  author={Christophe Andrieu},
In this paper we develop an original and general framework for automatically optimizing the statistical properties of Markov chain Monte Carlo (MCMC) samples, which are typically used to evaluate complex integrals. The Metropolis-Hastings algorithm is the basic building block of classical MCMC methods and requires the choice of a proposal distribution, which usually belongs to a parametric family. The correlation properties together with the exploratory ability of the Markov chain heavily… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 74 citations. REVIEW CITATIONS
49 Citations
11 References
Similar Papers


Publications citing this paper.

74 Citations

Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 11 references

On the Convergence

  • Andrieu
  • 2001

Implementation and Per

  • Browne, W. J. Draper 2000 Browne, D. Draper
  • 2000

On an Adaptive Metropolis-Hastings Algorithm with

  • J. asemyr
  • 2000
1 Excerpt

The Use of Multiple-Try Method

  • Liu
  • 2000

Posterior Simulation

  • Chib
  • 1998

Similar Papers

Loading similar papers…