Markov chain Monte Carlo without likelihoods
Open accessThe DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
Many stochastic simulation approaches for generating observations from a posterior distribution depend on knowing a likelihood function. However, for many complex probability models, such likelihoods are either impossible or computationally prohibitive to obtain. Here we present a Markov chain Monte Carlo method for generating observations from a posterior distribution without the use of likelihoods. It can also be used in frequentist applications, in particular for maximum-likelihood estimation. The approach is illustrated by an example of ancestral inference in population genetics. A number of open problems are highlighted in the discussion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The greatest computational advantage of the original ABC rejection algorithm over Monte Carlo based ABC methods is that it generates independent samples and therefore readily lends itself to ‘embarrassingly’ parallel computation [86]. The computation time thus scales linearly to the number of processors available.”
From Integrating Crop Growth Models with Whole Genome Prediction through Approximate Bayesian Computation (2015) · cites this paper as [86]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“If ϵ is sufficiently small then this distribution will be a good approximation for the ‘true’ posterior distribution, P(θ|D0).”
From Simulation-based model selection for dynamical systems in systems and population biology (2010) · cites this paper as Marjoram et al., 2003
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Moreover, related ideas are already applied in the context of generalized linear mixed models [16], unobserved data points [17].”
From Likelihood based observability analysis and confidence intervals for predictions of dynamic models (2012) · cites this paper as [17]
Experimental — accuracy not yet measuredIn the citing paper
“The price to pay is the generation of dependent outcomes, and the risk of getting stuck in regions of low probability of the state space for long periods of time.”
From Reverse engineering and identification in systems biology: strategies, perspectives and challenges (2014) · cites this paper as [193]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Approximate Bayesian computation in population genetics
Beaumont, M. A., Zhang, W., & Balding, D. J. (2002) · Genetics · doi:10.1093/genetics/162.4.2025 · Cited by 2,932
Ripley, B. D. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316726 · Cited by 2,241
Bayes and Empirical Bayes Methods for Data Analysis
(2001) · Technometrics · doi:10.1198/tech.2001.s608 · Cited by 2,098
On the genealogy of large populations
Kingmán, J. F. C. (1982) · Journal of Applied Probability · doi:10.1017/s0021900200034446 · Cited by 1,628
Population growth of human Y chromosomes: a study of Y chromosome microsatellites
Pritchard, J. K., Seielstad, M. T., Perez-Lezaun, A., & Feldman, M. W. (1999) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a026091 · Cited by 1,080
Bayes and Empirical Bayes Methods for Data Analysis, Second Edition
Carlin, B., & Louis, T. (2000) · Chapman & Hall/CRC Texts in Statistical Science · doi:10.1201/9781420057669 · Cited by 959
Research works printed but not linked: 4
- 10.2307/3213548 · doi:10.2307/3213548 · Paper page
- Stephens M. (2001) in Handbook of Statistical Genetics eds. Balding D. J. Bishop M. J. & Cannings C. (Wiley New York) pp. 213–238.
- Plagnol V. & Tavaré S. (2004) in Proceedings of the 5th International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing ed. Niederreiter H. (Springer Heidelberg).
- Cabrera J. & Yohai V. J. (1999) A New Computational Approach for Bayesian and Robust Bayesian Statistical Analysis www.rci.rutgers.edu/~cabrera/pap/vic.pdf preprint.
Cited by
Machine learning and the physical sciences
Carleo, G., Cirac, I., Cranmer, K., Daudet, L., Schuld, M., Tishby, N., Vogt-Maranto, L., & Zdeborová, L. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.045002 · Cited by 2,417
Probabilistic machine learning and artificial intelligence
Ghahramani, Z. (2015) · Nature · doi:10.1038/nature14541 · Cited by 1,995
“The fact that defining such universal inference algorithms for computer programs is even possible is somewhat surprising, but it is related to the generality of certain key ideas from sampling such as rejection sampling, sequential Monte Carlo methods 25 and ‘approximate Bayesian computation’ 49 .”
BackgroundToni, T., Welch, D., Strelkowa, N., Ipsen, A., & Stumpf, M. P. H. (2009) · Journal of The Royal Society Interface · doi:10.1098/rsif.2008.0172 · Cited by 1,498
“In ABC methods, the evaluation of the likelihood is replaced by a simulation-based procedure (Pritchard et al. 1999; Beaumont et al. 2002; Marjoram et al. 2003; Sisson et al. 2007).”
BackgroundMethodInfluentialApproximate Bayesian Computation (ABC) in practice
Csilléry, K., Blum, M. G. B., Gaggiotti, O. E., & François, O. (2010) · Trends in Ecology & Evolution · doi:10.1016/j.tree.2010.04.001 · Cited by 1,302
Approximate Bayesian Computation in Evolution and Ecology
Beaumont, M. A. (2010) · Annual Review of Ecology, Evolution, and Systematics · doi:10.1146/annurev-ecolsys-102209-144621 · Cited by 1,114
“As noted by Becquet & Przeworski (2007), there is a close relationship between the algorithm by Marjoram et al. (2003) and another algorithm that has become known as the pseudo-marginal method (Andrieu & Roberts 2009) introduced by Beaumont (2003).”
BackgroundMethodInfluential
Metadata
- Authors
- Marjoram, P., Molitor, J., Plagnol, V., & Tavaré, S.
- Affiliations
- University of Southern California (US)
- Venue
- Proceedings of the National Academy of Sciences
- Publisher
- National Academy of Sciences
- Published
- 2003-12-08
- Volume
- 100
- Issue
- 26
- Pages
- 15324-15328
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- PMC
- PMC307566
- OpenAlex
- W2045973738
- Cited by
- 1,199
- References
- 20
- Citations by year
- 2026: 26 · 2025: 38 · 2024: 54 · 2023: 54 · 2022: 57 · 2021: 72 · 2020: 83 · 2019: 79 · 2018: 88 · 2017: 68 · 2016: 76 · 2015: 79 · 2014: 86 · 2013: 64 · 2012: 60
- FWCI
- 12.01
- Type
- journal article
- Language
- en
- Open access
- green
- www.ncbi.nlm.nih.gov
- Locations
- Proceedings of the National Academy of Sciences (publishedVersion)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- UCL Discovery (University College London) (submittedVersion)
- Funders
- National Institutes of Health (5r01gm058897-03, GM58897)
- National Institute of General Medical Sciences (GM 58897)
- Division of Mathematical Sciences
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Markov Chains and Monte Carlo Methods
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Bayesian Inference
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genetic diversity and population structure
- Keywords
- Markov chain Monte Carlo, simulation-based inference, posterior sampling, maximum likelihood estimation, population genetics
- MeSH terms
- Algorithms, Computer Simulation, DNA, DNA, Mitochondrial, Biological Evolution, Genetics, Population, Humans, Markov Chains, Models, Biological, Monte Carlo Method, Stochastic Processes, Likelihood Functions
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Markov chain Monte Carlo without likelihoods. https://app.cochat.ai/papers/10.1073/pnas.0306899100
- The paper
- Marjoram, P., Molitor, J., Plagnol, V., & Tavaré, S. (2003). Markov chain Monte Carlo without likelihoods. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.0306899100
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.