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
- Kingman, J. F. C. (1982) J. Appl. Prob. 19A, 27–43. [Google Scholar] · 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
Items 601–700 of 1,000
Approximate Methods for Bayesian Computation
Craiu, R. V., & Levi, E. (2022) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-033121-110254 · Cited by 10
“…form of the ABC sampler makes it inefficient when the prior and posterior place most of their mass on different regions of Θ. Recognizing this, Marjoram et al. (2003) proposed an ABC-MCMC algorithm which relies on building a Metropolis-Hastings (MH) transition kernel, with state space {(θ,y)…”
MethodEstimating streamflow by an innovative rating curve model based on hydraulic parameters
Vatanchi, S. M., & Maghrebi, M. F. (2024) · Environmental Earth Sciences · doi:10.1007/s12665-024-11493-6 · Cited by 10
“This method is beneficial when dealing with complex models or when the likelihood function is difficult to compute analytically (Marjoram et al. 2003).”
Likelihood-Free Simulation-Based Optimal Design: An Introduction
Hainy, M., Müller, W. G., & Wagner, H. (2014) · Springer proceedings in mathematics & statistics · doi:10.1007/978-1-4939-2104-1_26 · Cited by 10
“, in [6]).”
Bayesian inference of substrate properties from film behavior
Aggarwal, R., Demkowicz, M. J., & Marzouk, Y. (2014) · Modelling and Simulation in Materials Science and Engineering · doi:10.1088/0965-0393/23/1/015009 · Cited by 10
“Approximate Bayesian computation methods [12, 13] could be used instead, but these would require many thousands or millions of model evaluations.”
MethodApproximate maximum likelihood estimation of the autologistic model
Bee, M., Espa, G., & Giuliani, D. (2014) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2014.10.019 · Cited by 11
Prediction of invasion from the early stage of an epidemic
Pérez-Reche, F. J., Neri, F. M., Taraskin, S. N., & Gilligan, C. A. (2012) · Journal of The Royal Society Interface · doi:10.1098/rsif.2012.0130 · Cited by 10
“This approach is similar to the Approximate Bayesian Computation (ABC) method that determines ρ(T̂ ) as the histogram of values of T̂ for which d2f ≤ ǫ, where ǫ is a parameter used in the method [32].”
ResultOn selection of statistics for approximate Bayesian computing (or the method of simulated moments)
Creel, M., & Kristensen, D. (2015) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2015.05.005 · Cited by 10
The natural mathematics of behavior analysis
Li, D., Hautus, M. J., & Elliffe, D. M. (2018) · Journal of the Experimental Analysis of Behavior · doi:10.1002/jeab.330 · Cited by 10
Harano, T., & Kutsukake, N. (2018) · Journal of Evolutionary Biology · doi:10.1111/jeb.13309 · Cited by 10
Ruiz‐Suarez, S., Barajas, V. L., Alvarez-Castro, I., & Morales, J. M. (2020) · PeerJ · doi:10.7717/peerj.8452 · Cited by 10
Chowdhury, A., & Egodawatta, P. (2022) · Water Science & Technology · doi:10.2166/wst.2022.207 · Cited by 10
Pesonen, H., Simola, U., Köhn‐Luque, A., Vuollekoski, H., Lai, X., Frigessi, A., Kaski, S., Frazier, D. T., Maneesoonthorn, W. O., Martin, G. M., et al. (2022) · International Statistical Review · doi:10.1111/insr.12522 · Cited by 21
A Likelihood-Free Particle Filter for Multi-Object Tracking
Sigges, F., Baum, M., & Hanebeck, U. D. (2017) · International Conference on Information Fusion (FUSION) · doi:10.23919/icif.2017.8009796 · Cited by 10
“Similar to the ABC rejection algorithm the MCMC ABC produces samples from the desired posterior distribution.”
BackgroundInfluentialEstimation of Bourgoyne and Young Model coefficients using Markov Chain Monte Carlo simulation
Formighieri, S., & Filho, P. J. D. F. (2015) · Winter Simulation Conference · doi:10.1109/wsc.2015.7408243 · Cited by 11
“This study estimated the BYM coefficients using Bayesian inference by MCMC. Simulations were run to provide estimates for three drill runs from three different wells in deep water regions.”
MethodInfluentialUse of Strain Typing Data to Estimate Bacterial Transmission Rates in Healthcare Settings
Jackson, B. R., Thomas, A., Carroll, K. C., Adler, F. R., & Samore, M. H. (2005) · Infection Control and Hospital Epidemiology · doi:10.1086/502594 · Cited by 10
Klinger, E., & Hasenauer, J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-67471-1_8 · Cited by 10
Understanding mammalian evolution using Bayesian phylogenetic inference
Kelly, C. D. (2005) · Mammal Review · doi:10.1111/j.1365-2907.2005.00064.x · Cited by 12
“(2003) investigated this issue using Murphy et al.’s (2001b) large molecular data set (see below for details), in conjunction with the above-mentioned Bayesian approaches for estimating posterior probabilities of divergence times (Thorne et al.”
ResultMultipoint Linkage Disequilibrium Mapping Using Multilocus Allele Frequency Data
Johnson, T. (2005) · Annals of Human Genetics · doi:10.1046/j.1529-8817.2005.00178.x · Cited by 10
“Because the profile likelihood behaves in a similar way to an ordinary likelihood and can be calculated very quickly, it (or functions of it) might be a useful summary statistic in testing for association, or in approximate Bayesian computation (see e.g. Beaumont et al. 2002; Marjoram et al. 2003).”
BackgroundReply to Robert et al.: Model criticism informs model choice and model comparison
Ratmann, O., Andrieu, C., Wiuf, C., & Richardson, S. T. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0912887107 · Cited by 11
“[14] can be adapted to provide samples from the target distribution fρ,τ (dθ, dx, dε1:K |x0,M) = πθ(θ|M)πε1:K (ε1:K |M)f(x|θ,M) fρ,τ (x0|M) ( δρ1:K(x)(dε1:K) dx dθ ) ,”
BackgroundKernel Recursive ABC: Point Estimation with Intractable LikelihoodPreprint
Kajihara, T., Kanagawa, M., Yamazaki, K., & Fukumizu, K. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.08404 · Cited by 15
“4 Data-cloning ABC (ABC-DC) (Picchini and Anderson, 2017) is an approach combining ABC-MCMC (Marjoram et al. , 2003) and Data Cloning (Lele et al. , 2010), replicating observed data multiple times to achieve MLE with intractable likelihood.”
MethodPandemic Lock-down, Isolation, and Exit Policies Based on Machine Learning PredictionsPreprint
Evgeniou, T., Fekom, M., Ovchinnikov, A. S., Porcher, R., Pouchol, C., & Vayatis, N. (2020) · SSRN Electronic Journal · doi:10.2139/ssrn.3588401 · Cited by 10
Estimating DSGE Models: Recent Advances and Future Challenges
Fernández‐Villaverde, J., & Guerron-Quintana, P. A. (2020) · National Bureau of Economic Research · doi:10.3386/w27715 · Cited by 15
Stockman, S., Lawson, D. J., & Werner, M. J. (2024) · Statistics and Computing · doi:10.1007/s11222-024-10486-6 · Cited by 10
“In light of this an MCMC approach to ABC makes proposals for new simulator parameters θ r ∼ q ( ·| θ r − 1 ) using a Metropolis-Hastings kernel (Beaumont et al., 2002; Marjoram et al., 2003).”
MethodPlank, M. J., Hendy, S. C., Binny, R. N., Vattiato, G., Lustig, A. G., & Maclaren, O. J. (2022) · Scientific Reports · doi:10.1038/s41598-022-25018-3 · Cited by 9
Sharp, N. P., Smith, D. R., Driscoll, G., Sun, K., Vickerman, C. M., & Martin, S. C. T. (2023) · Genome Biology and Evolution · doi:10.1093/gbe/evad179 · Cited by 9
“To efficiently explore the parameter space, we used the function ABC_mcmc from the R package EasyABC (Jabot et al. 2015), applying the method Marjoram (Marjoram et al. 2003; Wegmann et al. 2010) that uses a Markov chain Monte Carlo approach to generate observations from the posterior distribution.”
MethodHu, Z. H., Wang, H., & Zhou, Q. (2024) · Journal of Computational Physics · doi:10.1016/j.jcp.2024.112970 · Cited by 9
Rationalised experiment design for parameter estimation with sensitivity clustering
Chhajer, H., & Roy, R. (2024) · Scientific Reports · doi:10.1038/s41598-024-75539-2 · Cited by 9
“For instance, likelihood-based techniques are limited to systems where the likelihood function can be specified and a Gaussian distribution can be assumed for parameter distribution and measurement noise 26–28 .”
Ssematimba, A., Malladi, S., Bonney, P. J., Charles, K. M. S., Hutchinson, H. C., Schoenbaum, M., Marusak, R. A., Culhane, M. R., & Cardona, C. J. (2024) · PLoS ONE · doi:10.1371/journal.pone.0310733 · Cited by 9
Approximate Bayesian computation sequential Monte Carlo via random forests
Dinh, K. N., Liu, C., Xiang, Z., Liu, Z., & Tavaré, S. (2025) · Statistics and Computing · doi:10.1007/s11222-025-10748-x · Cited by 11
“Using statistics to summarize model simulations, ABC seeks the parameters that result in minimal distance between the statistics and those of the observed data.”
Self-citationApproximate Bayesian computation for railway track geometry parameter estimation
Ashley, G., & Attoh-Okine, N. (2020) · Proceedings of the Institution of Mechanical Engineers Part F Journal of Rail and Rapid Transit · doi:10.1177/0954409720977726 · Cited by 9
“The first method to be discussed and used in this research was presented by Marjoram et al.20 They first proposed the ABCMCMC likelihood-free approach.”
MethodInfluentialStatistical Challenges in Tracking the Evolution of SARS-CoV-2
Cappello, L., Kim, J., Liu, S., & Palacios, J. A. (2022) · Statistical Science · doi:10.1214/22-sts853 · Cited by 10
“(2012) and Poon (2015) used ABC-MCMC (Marjoram et al., 2003), while Saulnier, Gascuel and Alizon (2017) employed regression-based ABC (Blum and François, 2010). The ABC-based methods, however, are known to be sensitive to the choice of summary statistics, similarity measures, and match tolerance (Lintusaari et al., 20…”
MethodScore Matched Neural Exponential Families for Likelihood-Free Inference
Pacchiardi, L., & Dutta, R. (2020) · Warwick Research Archive Portal (University of Warwick) · doi:10.17863/cam.112525 · Cited by 9
Fan, F., Bayram, I. S., Zafar, U., Bayhan, S., Stephen, B., & Galloway, S. (2023) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2023.3323626 · Cited by 9
“In order to incorporate the temporal dependency of daily trips into the driving behaviour sampling, the MCMC simulation [27], [28] which can sample multiple sequences of random In this way, the temporal relationship between departure and arrival time and the correlation between daily outdoor…”
MethodInferring delays in partially observed gene regulation processes
Hong, H., Cortez, M. J., Cheng, Y., Kim, H. J., Choi, B., Josić́, K., & Kim, J. K. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btad670 · Cited by 9
“Our method is related to the ABC-MCMC approach (Marjoram et al. 2003), in which parameters are accepted stochastically.”
A new approach to choose acceptance cutoff for approximate Bayesian computation
Faisal, M., Futschik, A., & Hussain, I. (2013) · Journal of Applied Statistics · doi:10.1080/02664763.2012.756860 · Cited by 9
“For given and ρ and ∈, accepted observations are independent and identically distributed from f (θ/p(S′, S) ≤ ∈) (see [5]).”
BackgroundCabras, S., Castellanos, M. E., & Ruli, E. (2014) · METRON · doi:10.1007/s40300-014-0040-5 · Cited by 10
“This basic version has been embedded in more advanced Monte Carlo methods such as Sequential Monte Carlo (SMC), Importance Sampling or ABC-MCMC [22].”
MethodResultMike, W. (2013) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199695607.003.0008 · Cited by 9
ABC model selection for spatial extremes models applied to South Australian maximum temperature data
Lee, X. J., Hainy, M., McKeone, J. P., Drovandi, C., & Pettitt, A. N. (2018) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2018.06.019 · Cited by 11
“Markov chain Monte Carlo ABC (MCMC ABC) (Marjoram et al., 2003) and later sequential Monte Carlo ABC (SMC ABC) (Beaumont et al.”
MethodFitting the Bartlett–Lewis rainfall model using Approximate Bayesian Computation
Aryal, N. R., & Jones, O. D. (2019) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2019.10.018 · Cited by 9
“ABC was introduced by Pritchard et al. [7], and was later extended to incorporate Markov Chain Monte Carlo (MCMC) [8], or alternatively Sequential Monte Carlo (SMC) [9, 10, 11].”
MethodFinding our Way in the Dark: Approximate MCMC for Approximate Bayesian Methods
Levi, E., & Craiu, R. V. (2020) · Bayesian Analysis · doi:10.1214/20-ba1250 · Cited by 11
“Algorithm 2 presents the ABC-MCMC algorithm of Marjoram et al. (2003) which avoids sampling from the prior and instead relies on building a chain with a Metropolis-Hastings (MH) transition kernel, with state space {(θ,y) ∈ Rq×Xn}, proposal distribution q(ζ|θ)× f(y|ζ) and target distribution π…”
MethodReflections on Bayesian inference and Markov chain Monte Carlo
Craiu, R. V., Gustafson, P., & Rosenthal, J. S. (2022) · Canadian Journal of Statistics · doi:10.1002/cjs.11707 · Cited by 9
“Hence, parameter values that are drawn from the prior, as in S1, will rarely be retained.”
BackgroundMethodParameter Estimation Methods for Chaotic Intercellular Networks
Mariño, I. P., Ullner, E., & Zaikin, A. A. (2013) · PLoS ONE · doi:10.1371/journal.pone.0079892 · Cited by 11
Bayesian Symbol Detection in Wireless Relay Networks via Likelihood-Free Inference
Peters, G. W., Nevat, I., Sisson, S. A., Fan, Y., & Yuan, J. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2052457 · Cited by 9
Approximate Bayesian computation techniques for optical characterization of nanoparticle clusters
Eriçok, O. B., Cemgil, A. T., & Ertürk, H. (2017) · Journal of the Optical Society of America A · doi:10.1364/josaa.35.000088 · Cited by 9
Fine-tuning of Approximate Bayesian Computation for human population genomics
Cooke, N. P., & Nakagome, S. (2018) · Current Opinion in Genetics & Development · doi:10.1016/j.gde.2018.06.016 · Cited by 9
Péron, G., Bonenfant, C., Gagnon, R., & Mabika, C. T. (2019) · Biology Letters · doi:10.1098/rsbl.2019.0548 · Cited by 9
“In ABC, we compare the properties of simulated community compositions to those of the observed compositions (electronic supplementary material, appendix S2), in order to progressively exclude the simulation scenarios that are incompatible with our observations.”
InfluentialAn ABC approach for CAViaR models with asymmetric kernels
Tsiotas, G. (2020) · Journal of Statistical Computation and Simulation · doi:10.1080/00949655.2020.1727477 · Cited by 9
“In ABC-MCMC algorithms, one can approximate the posterior distribution within the MCMC engine (see [8,22]).”
MethodShevchenko, P. V. (2010) · Springer eBooks · doi:10.1007/978-3-642-15923-7_2 · Cited by 9
Approximate methods for dynamic ecological modelsPreprint
Fasiolo, M., & Wood, S. N. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.02644 · Cited by 9
“The tolerance can be a small scalar constant as in the MCMC-ABC algorithm of Marjoram et al. (2003), or it can be a vector of decreasing tolerances as in the SMC-ABC algorithm of Toni et al. (2009). In order to obtain a better approximation to π(θ|sobs), h should be chosen to be as small as possible, but the acceptanc…”
BackgroundMethodResultInfluentialEasyABC: a R package to perform ecient approximate Bayesian computation sampling schemes
Jabot, F., Faure, T., Dumoulin, N., & Albert, C. (2015) · Cited by 9
1 Prediction of invasion from the early stage of an epidemicPreprint
Pérez‐Reche, F. J., Neri, F. M., Taraskin, S. N., & Gilligan, C. A. (2016) · Cited by 9
Designing optimal behavioral experiments using machine learning
Valentin, S., Kleinegesse, S., Bramley, N. R., Seriès, P., Gutmann, M. U., & Lucas, C. G. (2024) · eLife · doi:10.7554/elife.86224 · Cited by 8
“There has been a growing interest in this class of models, often referred to as generative , implicit or simulator models (e.g., Cranmer et al., 2020; Brehmer et al., 2020; Sisson et al., 2007; Marjoram et al., 2003).”
BackgroundApproximate Bayesian Computation with Deep Learning and Conformal prediction
Baragatti, M., Casenave, C., Cloez, B., Métivier, D., & Sanchez, I. (2025) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2025.2546446 · Cited by 11
“Alternative samplers have therefore been proposed in a search for computational efficiency, using MCMC or filtering algorithms (see Marjoram et al. (2003), Sisson, Fan, and Tanaka (2007), Baragatti and Pudlo (2014) and references therein).”
Flevaris, K., Kotidis, P., & Kontoravdi, C. (2024) · Analytical and Bioanalytical Chemistry · doi:10.1007/s00216-024-05522-3 · Cited by 10
An off-lattice discrete model to characterise filamentous yeast colony morphology
Li, K., Green, J. E. F., Tronnolone, H., Tam, A., Black, A. J., Gardner, J. M., Sundstrom, J. F., Jiranek, V., & Binder, B. J. (2024) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1012605 · Cited by 8
Learning the two parameters of the Poisson–Dirichlet distribution with a forensic application
Cereda, G., Corradi, F., & Viscardi, C. (2022) · Scandinavian Journal of Statistics · doi:10.1111/sjos.12575 · Cited by 8
“However, the same is not valid for schemes allowing for parameters’ proposal following a Markov chain, such as in Marjoram et al. (2003), or when the tolerance parameters are adaptively determined, such as in Beaumont et al. (2009), and Del Moral et al. (2012).”
BackgroundEmerging uses of artificial intelligence in deep time biodiversity research
Silvestro, D., & Pimiento, C. (2025) · Nature Reviews Biodiversity · doi:10.1038/s44358-025-00075-4 · Cited by 4
“This process borrows concepts initially developed in approximate Bayesian computation 57 , whereby simulating the outcome of complex processes such as evolutionary processes is computationally more efficient than evaluating its likelihood to estimate the generating parameters.”
A model of inter-organizational network formation
Gaonkar, S., & Mele, A. (2023) · Journal of Economic Behavior & Organization · doi:10.1016/j.jebo.2023.07.028 · Cited by 8
A new extension of the two-parameter bathtub hazard shaped distribution
Sarhan, A. M., & Mustafa, A. (2022) · Scientific African · doi:10.1016/j.sciaf.2022.e01345 · Cited by 8
Gaskell, J., Campioni, N., Morales, J. M., Husmeier, D., & Torney, C. J. (2023) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0676 · Cited by 8
“In particular, improvements have aimed to develop more efficient proposal schemes for new parameters, using regression-based approaches [22], a modified Metropolis–Hastings scheme [23] or integrating a sequential Monte Carlo (SMC) sampling strategy [24] into the ABC scheme.”
MethodFerreira, J. R., Sena, A. P., Coutinho, J. P. D. S., Estumano, D. C., & Macêdo, E. N. (2023) · Numerical Heat Transfer Part A Applications · doi:10.1080/10407782.2023.2226820 · Cited by 8
“Many models do not allow a computationally tractable probability function p ( C j P ) [15, 26 – 30].”
Data-based modeling of breast cancer and optimal therapy
Pei, Y., Han, S., Li, C., Lei, J., & Wen, F. (2023) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2023.111593 · Cited by 8
Reliable Gradient-free and Likelihood-free Prompt Tuning
Shen, M., Ghosh, S. K., Sattigeri, P., Das, S., Bu, Y., & Wornell, G. W. (2023) · Findings of the Association for Computational Linguistics: EACL · doi:10.18653/v1/2023.findings-eacl.183 · Cited by 14
Islam, U. J., Paynabar, K., Runger, G. C., & Iquebal, A. S. (2024) · IISE Transactions · doi:10.1080/24725854.2024.2332910 · Cited by 10
“Different computational methods have been presented in the literature to overcome this limitation of ABC inference, among which ABC-MCMC and its variants have been widely used and accepted (Marjoram et al. , 2003).”
Kramer, A., & Radde, N. E. (2010) · Procedia Computer Science · doi:10.1016/j.procs.2010.04.184 · Cited by 10
Inferring Social Network Structure from Bacterial Sequence Data
Pluciński, M. M., Starfield, R., & Almeida, R. P. P. (2011) · PLoS ONE · doi:10.1371/journal.pone.0022685 · Cited by 8
“The posterior probability of p given the network distances Dij (equivalent to the likelihood when the prior is uniform) was calculated using a variation [16] of Approximate Bayesian Computation (ABC) [17].”
MethodApproximate Bayesian Computation Design (ABCD), an Introduction
Hainy, M., Müller, W. G., & Wynn, H. P. (2013) · Contributions to statistics · doi:10.1007/978-3-319-00218-7_16 · Cited by 8
“In the linear functional case, it is also possible to pursue the simulation based optimal design approach originally proposed by Müller (1999); the integrand in (5) is regarded as a joint distribution of the variables y, θ , and ξ .”
BackgroundBayesian Parameter Inference and Model Selection by Population Annealing in Systems Biology
Murakami, Y. (2014) · PLoS ONE · doi:10.1371/journal.pone.0104057 · Cited by 9
“In the PA algorithm, we transposed the MCMC process and the resampling process in the original PA algorithm [28].”
InfluentialRöding, M., Zagato, E., Remaut, K., & Braeckmans, K. (2016) · Physical review. E · doi:10.1103/physreve.93.063311 · Cited by 10
Vector Operations for Accelerating Expensive Bayesian Computations – A Tutorial Guide
Warne, D. J., Sisson, S. A., & Drovandi, C. (2021) · Bayesian Analysis · doi:10.1214/21-ba1265 · Cited by 10
“Hadamard notation indicates element-wise division, x ⊘ y, multiplication, x ◦ y and ex- Algorithm 4 SIMD implementation of MCMC proposals for SMC 1: for i = 1, 1 + V, 1 + 2V, . . . , Np + 1− V,Np do 2: Generate increments ξ1:Rn1:V ∼ N (0, hΣ̂); 3: Generate uniform variates u1:Rn1:V ∼ U(0, 1); 4: for r = 1, 2, . . . ,…”
MethodInfluentialThe initial properties of young star clusters in M83
Webb, J. J., & Sills, A. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa3832 · Cited by 9
Doronina, O. A., Murman, S. M., & Hamlington, P. E. (2021) · AIAA Journal · doi:10.2514/1.j060308 · Cited by 8
Bayesian model selection for the yeast GATA-factor network: A comparison of computational approaches
Milias‐Argeitis, A., Porreca, R., Summers, S., & Lygeros, J. (2010) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717307 · Cited by 8
“Each of the reduced MCMC runs is then performed, for increasing values of b, by fixing blocks θk,1, . . . , θk,b to θ∗k,1, . . . , θ ∗ k,b and sampling the remaining blocks for 2.5·104 steps.”
MethodInfluentialReconstructing disease transmission dynamics from animal movements and test data
Enright, J. A., & O’Hare, A. (2016) · Stochastic Environmental Research and Risk Assessment · doi:10.1007/s00477-016-1354-z · Cited by 9
“This ABC algorithm has been extended recently to approximate Markov Chain Monte Carlo algorithms (Marjoram et al. 2003) and to approximate sequential Monte Carlo algorithms (Sisson et al. 2007).”
MethodCoalescent framework for prokaryotes undergoing interspecific homologous recombination
Akita, T., Takuno, S., & Innan, H. (2018) · Heredity · doi:10.1038/s41437-017-0034-1 · Cited by 10
Hydrological post-processing based on approximate Bayesian computation (ABC)
Romero-Cuéllar, J., Abbruzzo, A., Adelfio, G., & Francés, F. (2019) · Stochastic Environmental Research and Risk Assessment · doi:10.1007/s00477-019-01694-y · Cited by 9
Filipe, J. A. N., & Kyriazakis, I. (2019) · Frontiers in Genetics · doi:10.3389/fgene.2019.00727 · Cited by 10
“We implemented ABC using MCMC sampling (Marjoram et al., 2003).”
Haba, Y., & Kutsukake, N. (2019) · Evolutionary Ecology · doi:10.1007/s10682-019-10011-6 · Cited by 8
“Several methods of judgment exist (Marjoram et al. 2003; Marjoram and Tavare 2006).”
Genetics: Genetics and Stochastic SimulationDoMix!
Sisson, S. A. (2007) · The American Statistician · doi:10.1198/000313007x169965 · Cited by 9
“In contrast, the early approximate Bayesian computation papers (Beaumont et al. 2002; Marjoram et al. 2003) respectively appeared in Genetics and the mildly biologically oriented PNAS.”
InfluentialSemi-parametric dynamic time series modelling with applications to detecting neural dynamics
Rigat, F., & Smith, J. Q. (2009) · The Annals of Applied Statistics · doi:10.1214/09-aoas275 · Cited by 9
“On the one hand, faster resampling methods such as particle filters [Doucet, De Freitas and Gordon (2001)] and approximate Bayesian computation [Marjoram et al. (2003)] can be adopted.”
MethodTransflow Learning: Repurposing Flow Models Without RetrainingPreprint
Gambardella, A., Baydin, A. G., & Torr, P. H. S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.13270 · Cited by 9
“This is similar to the use of approximate Bayesian computation [20, 26] likelihoods in Bayesian inverse graphics [19], where the variance of the likelihood plays the role of a “tolerance” in judging how closely an image generated by the generative model matches an observed image.”
MethodReichert, P., Ammann, L., & Fenicia, F. (2020) · doi:10.5194/egusphere-egu2020-6765 · Cited by 8
Metropolis-Hastings with Averaged Acceptance RatiosPreprint
Andrieu, C., Yıldırım, S., Arnaud Doucet, B., & Chopin, N. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.01253 · Cited by 8
“Approximate Bayesian computation (ABC) [Pritchard et al., 1999, Beaumont et al., 2002, Marjoram et al., 2003] is a general methodology to address inference in such scenarios.”
MethodStatistical Inference Utilizing Agent Based Models
Heard, D. (2014) · DukeSpace (Duke University) · Cited by 12
Nezworski, J., Charles, K. M. S., Malladi, S., Ssematimba, A., Bonney, P. J., Cardona, C. J., Halvorson, D. A., & Culhane, M. R. (2021) · Avian Diseases · doi:10.1637/aviandiseases-d-21-00019 · Cited by 7
“The input prior distributions used in the ABC approach are summarized in Table 2.”
InfluentialImage Segmentation Using Bayesian Inference for Convex Variant Mumford–Shah Variational Model
Xiao, X., Wen, Y., Chan, R. H., & Zeng, T. (2024) · SIAM Journal on Imaging Sciences · doi:10.1137/23m1545379 · Cited by 7
Cui, J., Biesiada, M., Liu, A., Wen, C., Liu, T., & Wang, J. (2025) · The Astrophysical Journal Supplement Series · doi:10.3847/1538-4365/adef3f · Cited by 7
“These techniques circumvent the direct computation of likelihood functions, with Approximate Bayesian Computation (ABC; Marjoram et al. (2003); Bonassi & West (2015)) being one of the pioneering approaches.”
Maceda, E., Hector, E. C., Lenzi, A., & Reich, B. J. (2026) · Environmetrics · doi:10.1002/env.70074 · Cited by 7
“To mitigate the curse of dimensionality inherent in standard ABC methods when the number of model parameters is large, Li et al. (2017) proposed a copula approach that first estimates the bivariate posterior for each pair of parameters separately and then combines these estimates together to estimate the joint posteri…”
InfluentialShim, H. (2019) · Springer eBooks · doi:10.1007/978-3-030-29022-1_17 · Cited by 9
“Thus, MCMC is introduced as a randomized algorithm that makes the sampling process more efficient by making the probability of sampling an output approximately equal to the target probability distribution.”
BackgroundMethodInfluentialStatistical Tests and Association Measures for Business Processes
Leemans, S. J. J., McGree, J. M., Polyvyanyy, A., & ter Hofstede, A. H. M. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3197840 · Cited by 10
“An example of such an approach is approximate Bayesian computation which aims to find a posterior distribution based on samples of parameters that yield simulated data that are close to the initial sample [14].”
BackgroundMethodPrescott, T. P., Warne, D. J., & Baker, R. E. (2023) · Journal of Computational Physics · doi:10.1016/j.jcp.2023.112577 · Cited by 8
“…approach to likelihood-free inference is one of a number of strategies for speeding up inference, which include MCMC and SMC sampling techniques [Marjoram et al., 2003, Sisson et al., 2007, Toni et al., 2009] and methods for variance reduction such as multilevel estimation [Giles, 2015, Guha…”
MethodAlternatives to the Least Squares Solution to Peelle’s Pertinent Puzzle
Burr, T. L., Graves, T., Hengartner, N., Kawano, T., Pan, F., & Talou, P. (2011) · Algorithms · doi:10.3390/a4020115 · Cited by 7
“Therefore, we considered the following three topics: (1) alternatives to GLS when there is estimation error in Σ̂, (2) approximate Bayesian computation [22] to provide estimators other than GLS that use the estimated likelihood in the case of non-normal error models that make ML estimation difficult, and (3) completio…”
BackgroundMethodA Likelihood-Free Reverse Sampler of the Posterior Distribution
Forneron, J.-J., & Ng, S. (2016) · Emerald Group Publishing Limited eBooks · doi:10.1108/s0731-905320160000036020 · Cited by 13
“We consider the MCMC implementation of ABC proposed in Marjoram et al. (2003) (hereafter, MCMC-ABC).”
BackgroundMethodInfluentialAutomatic Sampler Discovery via Probabilistic Programming and Approximate Bayesian Computation
Perov, Y., & Wood, F. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-41649-6_27 · Cited by 7
“We then report results from experiments in which we test our approach in all three scenarios for how we can compute the ABC penalty d.”
MethodInfluentialLaurin-Lemay, S., Rodrigue, N., Lartillot, N., & Philippe, H. (2018) · Molecular Biology and Evolution · doi:10.1093/molbev/msy173 · Cited by 8
“Accordingly, the high-dimensional amino-acid profiles and the branch lengths were estimated by MCMC under the reference posterior distribution, with k CpG ¼ 1 (i.e., were included in h wc ), while the 10 GTR parameters (8 degrees of freedom), as well as three modulator parameters (meant as correcting factors for total…”
BackgroundMethodInfluentialA new POD-based approximate bayesian computation method to identify parameters for formed AHSS
Zeng, Y., Yu, X., & Wang, H. (2018) · International Journal of Solids and Structures · doi:10.1016/j.ijsolstr.2018.10.020 · Cited by 7
Approximate Bayesian computation for Lorenz curves from grouped data
Kobayashi, G., & Kakamu, K. (2018) · Computational Statistics · doi:10.1007/s00180-018-0831-x · Cited by 7
A New Bayesian Methodology for Nonlinear Model Calibration in Computational Systems Biology
Bianconi, F., Tomassoni, L., Antonini, C., & Valigi, P. (2020) · Frontiers in Applied Mathematics and Statistics · doi:10.3389/fams.2020.00025 · Cited by 7
“An improvement of the first version of ABC algorithm is ABC based on Markov chain Monte Carlo (ABC-MCMC algorithm), that exploits a Markov chain to explore the parameter space [39].”
MethodSeeman, J., Slavković, A., & Reimherr, M. L. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-57521-2_23 · Cited by 10
Mahrouz, N. (2020) · Journal of Hydrologic Engineering · doi:10.1061/(asce)he.1943-5584.0002048 · Cited by 7
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
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.