Cited by 2,451Markov Chains and Monte Carlo MethodsGaussian Processes and Bayesian InferenceBayesian Modeling and Causal Inference

An introduction to MCMC for machine learning.

Open access
Andrieu, Christophe, de Freitas, Nando, Doucet, Arnaud, Jordan, Michael I.·2003·Machine Learning

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1023/a:1020281327116

Cites

171 of 171 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 8

  1. Classical mixture models. Mixtures of independent factor analysers (Utsugi, 2001) and mixtures of factor analysers (Fokoué & Titterington, this issue). We hope that this review will be a useful resource to people wishing to carry out further research at the interface between MCMC and machine learning. For conciseness, we have skipped many interesting ideas, including tempering and coupling. For more details, we advise the readers to consult the references at the end of this paper.
  2. Carlin, B. P., & Chib, S. (1995). Bayesian Model choice via MCMC. Journal of the Royal Statistical Society Series B, 57, 473-484.
  3. Celeux, G., & Diebolt, J. (1985). The SEM algorithm: A probabilistic teacher algorithm derived from the EM algorithm for the mixture problem. Computational Statistics Quarterly, 2, 73-82.
  4. Doucet, A., Godsill, S. J., & Robert, C. P. (2000). Marginal maximum a posteriori estimation using MCMC. Technical Report CUED/F-INFENG/TR 375, Cambridge University Engineering Department.
  5. Gilks, W. R., & Berzuini, C. (1998). Monte Carlo inference for dynamic Bayesian models. Unpublished. Medical Research Council, Cambridge, UK.
  6. Kam, A. H. (2000). A general multiscale scheme for unsupervised image segmentation. Ph.D. Thesis, Department of Engineering, Cambridge University, Cambridge, UK.
  7. Mira, A. (1999). Ordering, slicing and splitting Monte Carlo Markov chains. Ph.D. Thesis, School of Statistics, University of Minnesota.
  8. Rubin, D. B. (1998). Using the SIR algorithm to simulate posterior distributions. In J. M. Bernardo, M. H. DeGroot, D. V. Lindley, & A. F. M. Smith (Eds.), Bayesian statistics 3 (pp. 395-402). Cambridge, MA: Oxford University Press.

Cited by

Sorted by citations

Authors
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I.
Affiliations
  • University of Bristol (GB)
  • University of California, Berkeley (US)
Corresponding author
  • Andrieu, Christophe
  • Jordan, Michael I.
Venue
Machine Learning
Published
2003-01
Volume
50
Issue
1-2
Pages
5-43
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W2135194391
Cited by
2,451
References
166
Citations by year
2026: 61 · 2025: 81 · 2024: 92 · 2023: 118 · 2022: 141 · 2021: 176 · 2020: 170 · 2019: 175 · 2018: 160 · 2017: 148 · 2016: 129 · 2015: 128 · 2014: 122 · 2013: 102 · 2012: 121
FWCI
36.33
Type
journal article
Language
en
Open access
Locations
  • Machine Learning (publishedVersion)
  • Explore Bristol Research (submittedVersion)
Topics
  • Physical Sciences › Mathematics › Statistics and Probability › Markov Chains and Monte Carlo Methods
  • Physical Sciences › Computer Science › Artificial Intelligence › Gaussian Processes and Bayesian Inference
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
Keywords
Markov chain Monte Carlo, Monte Carlo methods, probabilistic machine learning, MCMC simulation, sampling methods

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review