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 801–900 of 1,000
Approximate Bayesian Computation for Discrete Spaces
Auzina, I. A., & Tomczak, J. M. (2021) · Entropy · doi:10.3390/e23030312 · Cited by 4
“The first approach, known as the ABC-rejection scheme, has been successfully applied in biology [8,9], and since, then many alternative versions of the algorithm have been introduced, with the three main groups represented by Markov Chain Monte Carlo (MCMC) ABC [10], Sequential Monte Carlo (SMC) ABC [11], and neural n…”
MethodWest, B., Wood, A. J., & Ungár, D. (2021) · Methods in molecular biology · doi:10.1007/978-1-0716-1685-7_10 · Cited by 4
Deep Learning for Marginal Bayesian Posterior Inference with Recurrent Neural Networks
Fisher, T., Luedtke, A. R., Carone, M., & Simon, N. (2022) · Statistica Sinica · doi:10.5705/ss.202020.0348 · Cited by 4
Spatial-temporal rainfall models based on poisson cluster processes
Aryal, N. R., & Jones, O. D. (2021) · Stochastic Environmental Research and Risk Assessment · doi:10.1007/s00477-021-02046-5 · Cited by 4
Statistical modeling of diabetic neuropathy: Exploring the dynamics of nerve mortality
Konstantinou, K., Ghorbanpour, F., Picchini, U., Loavenbruck, A. J., & Särkkä, A. (2023) · Statistics in Medicine · doi:10.1002/sim.9851 · Cited by 4
“More sophisticated ABC methods taking into account information about the previously accepted draws for θ have been suggested, both in an MCMC framework [19, 27] and as sequential Monte Carlo algorithms ([32], [3], [6]).”
MethodCombinatorial and algebraic perspectives on the marginal independence structure of Bayesian networks
Deligeorgaki, D., MARKHAM, A. F., Misra, P., & Solus, L. (2023) · Algebraic Statistics · doi:10.2140/astat.2023.14.233 · Cited by 6
“…Gröbner-based Unconditional Equivalence Search In this section, we combine the results of Sections 3, 4 and 5 to develop GrUES (Algorithm 6.1.1), a Markov Chain Monte Carlo (MCMC) method [Hastings, 1970, Marjoram et al., 2003] for estimating the marginal independence structure of a DAG model.”
MethodInfluentialCoupling random inputs for parameter estimation in complex models
Spence, M. A., & Blackwell, P. G. (2015) · Statistics and Computing · doi:10.1007/s11222-015-9593-2 · Cited by 4
“Marjoram et al. (2003) developed a method of using ABC to approximate the likelihood in an MCMC approach.”
MethodRobert, C. P. (2011) · Winter Simulation Conference · doi:10.1109/wsc.2011.6147744 · Cited by 5
“As an answer to this problem, Marjoram, Molitor, Plagnol, and Tavar´e (2003) have introduced an MCMC-ABC algorithm targeting (1).”
BackgroundWilkinson, D. J. (2011) · Wiley eBooks · doi:10.1002/9781119970606.ch18 · Cited by 4
(2019) · MODSIM · doi:10.36334/modsim.2019.k14.bennett · Cited by 4
“The basic principle of ABC is that if the summary statistic is sufficient and 𝜖 is small then sampling from 𝑝(𝜃|𝐷) 𝜖 should give a good approximation of the true posterior 𝑝( 𝜃 | 𝐷 ) (Marjoram et al. 2003; Sisson et al. 2007).”
Background集団内変異データが語る過去 : 解析手法と理論的背景(その1)
秀樹, 印., & Yamamichi, M. (2009) · SOKENDAI (Graduate University for Advanced Studies) · doi:10.18960/seitai.59.3_339 · Cited by 4
Efficient Bayesian inference in stochastic chemical kinetic models using graphical processing unitsPreprint
Niemi, J., & Wheeler, M. W. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1101.4242 · Cited by 4
“In particular, we utilize a special case of MCMC known as Gibbs sampling [Marjoram et al., 2003].”
MethodStochastic Weather Generation with Approximate Bayesian Computation
Olson, B. J. (2016) · CU Scholar (University of Colorado Boulder) · Cited by 4
Approximate B ayesian Computation
Drovandi, C. (2017) · Wiley eBooks · doi:10.1002/9781118445112.stat07974 · Cited by 4
“Marjoram et al. (2003) develop an MCMC approach to ABC, which allows proposals to be made locally in high posterior support regions.”
MethodAdversarial Likelihood-Free Inference on Black-Box GeneratorPreprint
Kim, D., Joo, W., Shin, S., Song, K., & Moon, I.-C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.05803 · Cited by 4
Liu, S., She, D., Zhang, L., & Xia, J. (2023) · doi:10.5194/hess-2022-414 · Cited by 4
Growth Dynamics of Ductal Carcinoma in Situ Recapitulate Normal Breast DevelopmentPreprint
Ryser, M. D., Greenwald, M. A., Sorribes, I. C., King, L. M., Hall, A. H. S., Geradts, J., Weaver, D. L., Mallo, D., Holloway, S. T., Monyak, D. L., et al. (2023) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2023.10.01.560370 · Cited by 4
Permutations accelerate Approximate Bayesian ComputationPreprint
Luciano, A., Andral, C., Robert, C. P., & Ryder, R. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2507.06037 · Cited by 4
“Marjoram et al. [2003] proposed ABC-MCMC, which uses a Markov chain to guide parameter proposals toward regions of high posterior mass.”
Prediction of COVID-19 cases using SIR and AR models: Tokyo-specific and nationwide application
Seki, T., Sakurai, T., Miyata, S., Chujo, K., Murata, T., Inoue, H., & Ito, N. (2024) · Artificial Life and Robotics · doi:10.1007/s10015-024-00959-2 · Cited by 3
“Because the basic method is less efficient given the dimensionality issues, there are other methods, such as the method proposed in [13], to compare S ( y ) with S ( y ∗ ) to obtain an appropriate summary function S ( ⋅ ) or the MCMC-ABC [14] method used to add perturbations to the appropriate parameters to generate n…”
Wenzel, A. R., Haughey, P., Nguyen, K., Nardini, J. T., Haugh, J. M., & Flores, K. (2026) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1014801 · Cited by 4
Approximate Bayesian computation for estimating rate constants in biochemical reaction systems
Wu, Q., Smith‐Miles, K., & Tian, T. (2013) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm.2013.6732528 · Cited by 3
Prospects for trachoma elimination through mass treatment targeted at children
Ying, R., Williams, P., & Dorratoltaj, N. (2016) · Agent-Directed Simulation · doi:10.22360/springsim.2016.ads.020 · Cited by 4
Goodness of fit for models with intractable likelihood
Cabras, S., Castellanos, M. E., & Ratmann, O. (2021) · Test · doi:10.1007/s11749-020-00747-7 · Cited by 3
Flexible Bayesian inference on partially observed epidemics
Wang, M. H., & Onnela, J.-P. “. (2024) · Journal of Complex Networks · doi:10.1093/comnet/cnae017 · Cited by 6
Electrostatics facilitate midair host attachment in parasitic jumping nematodes
Ran, R., Burton, J. C., Kumar, S., Bhamla, M. S., Dillman, A. R., & Ortega-Jiménez, V. M. (2025) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2503555122 · Cited by 3
Parallel computations for Metropolis Markov chains with Picard maps
Grazzi, S., & Zanella, G. (2026) · Biometrika · doi:10.1093/biomet/asag022 · Cited by 3
“…requiring complex numerical solvers) or when the gradient is not well-defined such as in models with censored data (e.g. the SIR model considered in Section 6), in Pseudo-Marginal MCMC [Andrieu and Roberts, 2009] and in Approximate Bayes Computation (ABC) MCMC setting [Marjoram et al., 2003].”
Christopher, J., Lapointe, C. B., Wimer, N. T., Hayden, T. R. S., Grooms, I. G., Rieker, G. B., & Hamlington, P. E. (2017) · AIAA Computational Fluid Dynamics Conference · doi:10.2514/6.2017-3629 · Cited by 3
Autonomic Closure for Turbulent Flows Using Approximate Bayesian Computation
Doronina, O. A., Christopher, J., Towery, C., Hamlington, P. E., & Dahm, W. J. A. (2018) · AIAA Aerospace Sciences Meeting · doi:10.2514/6.2018-0594 · Cited by 3
da Costa, J. M. J., Orlande, H. R. B., Lione, V. D. O. F., Lima, A. G. F., Cardoso, T. D. C. S., & Varón, L. A. B. (2018) · Journal of Computational Biology · doi:10.1089/cmb.2017.0130 · Cited by 3
“The so-called ABC can be utilized for such cases, as well as for others, where the computation of the likelihood function becomes intractable (Beaumont et al., 2002; Marjoram et al., 2003; Toni et al., 2009; Wegmann et al., 2009; Toni and Stumpf, 2010a).”
Optima HIV Methodology and Approach
Kerr, C. C., Stuart, R. M., Kedziora, D. J., Brown, A., Abeysuriya, R., Chadderdon, G. L., Nachesa, A., & Wilson, D. P. (2020) · World Bank, Washington, DC eBooks · doi:10.1596/978-1-4648-1523-2_ch13 · Cited by 3
Breaking the structure of MaMaDroid
Berger, H., Dvir, A. Z., Mariconti, E., & Hajaj, C. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120429 · Cited by 3
Comparison of state of the art sampling-based Bayesian Updating techniques
Dodt, M. B., Kitahara, M., Broggi, M., & Beer, M. (2022) · International Symposium on Reliability Engineering and Risk Management (ISRERM) · doi:10.3850/978-981-18-5184-1_ms-02-146-cd · Cited by 3
Efficient design of synthetic gene circuits under cell-to-cell variability
Turpin, B., Bijman, E. Y., Kaltenbach, H., & Stelling, J. (2023) · BMC Bioinformatics · doi:10.1186/s12859-023-05538-z · Cited by 3
“An equivalent technique is known as likelihood-free sampling or subset simulation in the context of Bayesian models, where it is applied to sampling datasets rather than parameters [27, 28].”
MethodXiang, Z., Liu, Z., & Dinh, K. N. (2024) · Scientific Reports · doi:10.1038/s41598-024-67842-9 · Cited by 4
“Algorithms such as sequential Monte Carlo (SMC) 49 or Markov Chain Monte Carlo (MCMC) 33 , which use a metric to compare statistics between the model and data, would likely suffer more from the increased noise level of these measures.”
Muhammad, M., Abba, B., & Xiao, J. (2025) · IEEE Access · doi:10.1109/access.2025.3552486 · Cited by 3
“To overcomes this draw back, practitioners provided an advanced hybrid ABC algorithms to upgrade the ABC method, among them is the ABC-MCMC introduced by [35].”
Wang, M. H., & Onnela, J.-P. “. (2025) · Applied Network Science · doi:10.1007/s41109-025-00694-y · Cited by 3
“To demonstrate the use of an alternative ABC algorithm, in the “Appendix”, we also show the posterior distributions obtained using SMC-ABC (Toni et al. 2009) instead of rejection ABC for our ABC sampling step.”
Calibrating Non-Identifiable High-Dimensional Simulation Models: A Framework via Eligibility Set
Bai, Y., Balch, T. R., Chen, H., Dervovic, D., Lam, H., & Vyetrenko, S. (2025) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/3742427 · Cited by 4
“However, as the likelihood function is not directly available, the posterior can often be updated only via approximate Bayesian computation ( ABC ) [75, 83], by running acceptance-rejection on simulated samples that is computationally costly and requires ad hoc tuning [76, 84].”
Tree Bandits for Generative Bayes
O'Hagan, S., Kim, J., & Ročková, V. (2026) · Journal of the American Statistical Association · doi:10.1080/01621459.2026.2658285 · Cited by 4
集団内変異データが語る過去 : 解析手法と理論的背景(その2)( 始めよう!エコゲノミクス(4))
Yamamichi, M., & 秀樹, 印. (2010) · SOKENDAI (Graduate University for Advanced Studies) · doi:10.18960/seitai.60.1_137 · Cited by 3
A Not-So-Long Introduction to Computational Molecular Evolution
Aris‐Brosou, S., & Rodrigue, N. (2019) · Methods in molecular biology · doi:10.1007/978-1-4939-9074-0_3 · Cited by 3
“As a result, a number of variations have been described, trying either to correlate sample draws as in MCMC samplers [113] or to resample sequentially from the past [114, 115].”
BackgroundRapid Bayesian Inference for Expensive Stochastic Models
Warne, D. J., Baker, R. E., & Simpson, M. J. (2021) · QUT ePrints (Queensland University of Technology) · doi:10.6084/m9.figshare.16934424 · Cited by 3
Zhang, H., Chen, J., & Tian, T. (2020) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2020.3039490 · Cited by 3
“A number of methods have been developed including ABC-MCMC [17], [18], and sequential Monte-Carlo sampling algo-rithm [19], [20], [21].”
MethodTsutaya, T., & Yoneda, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.2468 · Cited by 3
“Several algorithms have been proposed to increase the sampling efficiency, by introducing weighting with regression analysis [55, 56], Markov chain Monte Carlo sampling [57], and sequential Monte Carlo (SMC) sampling [58–60].”
MethodOn Consistency of Approximate Bayesian ComputationPreprint
Frazier, D. T., Martin, G. M., & Robert, C. P. (2015) · arXiv (Cornell University) · doi:10.26180/21521313 · Cited by 3
Modeling human genetic history
Chikhi, L., & Beaumont, M. (2005) · Wiley eBooks · doi:10.1002/047001153x.g101201 · Cited by 3
Liu, X., & Niranjan, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.09021 · Cited by 4
“S4 , it is easy to observe that the original ABC-MCMC poorly performs with the coarse acceptance criterion, while it can produce the accurate inference by using a small tolerance ǫ .”
MethodVariational Inference over Non-differentiable Cardiac Simulators using Bayesian OptimizationPreprint
McCarthy, A., Rodríguez, B., & Mincholé, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.03353 · Cited by 3
Soft Constraints for Inference with Declarative KnowledgePreprint
Tavares, Z., Burroni, J., Minaysan, E., Solar-Lezama, A., & Ranganath, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.05437 · Cited by 4
“Marjoram et al. (2003) simulated Markov Chains according to the prior, but introduced the accept/reject stage to yield approximate posterior samples.”
MethodA simple recipe for making accurate parametric inference in finite samplePreprint
Guerrier, S., Karemera, M., Orso, S., & Victoria‐Feser, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.06750 · Cited by 3
“[44, 45]), the sequential Monte Carlo sampling (see e.”
BackgroundStratified sampling and bootstrapping for approximate Bayesian computationPreprint
Picchini, U., & Everitt, R. G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.07976 · Cited by 3
“However, the choice M = 1 is often favoured: in most cases because this was the approach originally described in the ABC literature (e.g. Marjoram et al., 2003); but also because the increased computational cost of taking M > 1 often outweighs the improvement in efficiency [Bornn et al., 2017].”
MethodA Pseudo-Marginal Perspective on the ABC AlgorithmPreprint
Bornn, L., Pillai, N. S., Smith, A. D., & Woodard, D. B. (2014) · arXiv (Cornell University) · Cited by 3
Likelihood-free MCMC with Amortized Approximate Likelihood RatiosPreprint
Hermans, J., Begy, V., & Louppe, G. (2019) · arXiv (Cornell University) · Cited by 3
Analysing cultural frequency data: neutral theory and beyondPreprint
Kandler, A., & Crema, E. R. (2018) · SocArXiv (OSF Preprints) · doi:10.31235/osf.io/kvmzu · Cited by 3
ABC for high-dimensional modular models via MCMC samplesPreprint
Zhu, Z., Christodoulou, M. D., & Steinsaltz, D. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.07.02.662793 · Cited by 3
“These methods have widespread applications across various fields, including ecology, genetics, and epidemiology (Tavar´e et al. (1997); Beaumont et al. (2002); Marjoram et al. (2003)).”
Gros‐Balthazard, M. (2012) · theses.fr (ABES) · doi:10.70675/186b1a9ez07d7z4eaazb020z10a94043bb69 · Cited by 5
Stochastic and deterministic kinetic equations in the context of mathematics applied to biology
Caillerie, N. (2017) · theses.fr (ABES) · doi:10.70675/9f0947dbz8b9az4b4az852cz73d4aac73850 · Cited by 3
Generalized multiple-point Metropolis algorithms for approximate Bayesian computation
Kobayashi, G., & Kozumi, H. (2013) · Journal of Statistical Computation and Simulation · doi:10.1080/00949655.2013.836652 · Cited by 2
“[8] proposed an ABC algorithm based on MCMC (ABC-MCMC) and showed that the proposed algorithm outperformed the rejection ABC algorithm in terms of acceptance rate.”
MethodStochastic black-box optimization using multi-fidelity score function estimator
Agrawal, A. K., Ravi, K., Koutsourelakis, P., & Bungartz, H. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad8e2b · Cited by 2
Cho, H., Cho, S. W., Jo, H., & Hwang, H. J. (2026) · SIAM Journal on Scientific Computing · doi:10.1137/25m1820679 · Cited by 3
León, R. M. D., Vega, M., Gernandt, D. S., Jaramillo‐Correa, J. P., & Moreno‐Letelier, A. (2025) · Molecular Ecology · doi:10.1111/mec.70132 · Cited by 2
“This analysis employed the likelihood-free Markov chain Monte Carlo (MCMC) approach of Marjoram et al. (2003), implemented in ABCToolbox (Wegmann et al. 2010).”
Approximate Bayesian Computation with Statistical Distances for Model Selection
Grazian, C. (2025) · Bayesian Analysis · doi:10.1214/26-ba1586 · Cited by 2
“Extensions of rejection ABC more computationally efficient have been proposed by Beaumont et al. (2002); Marjoram et al. (2003); Sisson et al. (2007); Beaumont et al. (2009); Del Moral et al. (2011).”
Daher, A., Trucu, D., & Eftimie, R. (2026) · npj Systems Biology and Applications · doi:10.1038/s41540-026-00657-8 · Cited by 2
“Whentheposteriordistributionisfarfromtheprior, samplingdirectly from the prior in the ABC rejection sampler is often inef fi cient due to low acceptance rates 54 .”
Deng, D., Zeng, X., Pang, Q., Bai, S., Tian, T., Yang, H., Yang, Z., Yang, L., & Wu, Z. (2026) · Thin-Walled Structures · doi:10.1016/j.tws.2026.114754 · Cited by 2
Microstructure of a granular amorphous silica ceramic synthesized by spark plasma sintering
Röding, M., Castillo, L. A. D., Nydén, M., & Follink, B. (2016) · Journal of Microscopy · doi:10.1111/jmi.12442 · Cited by 2
“We estimate the parameter vector (θ−, ρ−, ρ+) from an SEM image using approximate Bayesian computation (Tavaré et al., 1997; Pritchard et al., 1999; Marjoram et al., 2003).”
A likelihood-free Bayesian derivation method for service variants
Rasmussen, R., Barros, A., & Wei, F. (2018) · Journal of Systems and Software · doi:10.1016/j.jss.2018.05.011 · Cited by 2
Lu, L., & Yuan, T. (2020) · Nuclear Instruments and Methods in Physics Research Section A Accelerators Spectrometers Detectors and Associated Equipment · doi:10.1016/j.nima.2020.163678 · Cited by 2
On predictive inference for intractable models via approximate Bayesian computation
Järvenpää, M., & Corander, J. (2023) · Statistics and Computing · doi:10.1007/s11222-022-10163-6 · Cited by 5
“This is also the case with ABC-MCMC (Marjoram et al. 2003).”
MethodResultKerama, I., Thorne, T., & Everitt, R. G. (2026) · Statistics and Computing · doi:10.1007/s11222-026-10979-6 · Cited by 2
“The ABC-MCMC algorithm of Marjoram et al. (2003) is shown in algorithm 1.”
Approximate Confidence Distribution Computing
Thornton, S., Li, W., & Xie, M. (2023) · The New England Journal of Statistics in Data Science · doi:10.51387/23-nejsds38 · Cited by 2
Evolution of Transcript Abundance is Influenced by Indels in Protein Low Complexity Regions
Dickson, Z. W., & Golding, G. B. (2024) · Journal of Molecular Evolution · doi:10.1007/s00239-024-10158-z · Cited by 2
“Marjoram et al. (2003) illustrated a method to use Markov Chain Monte Carlo (MCMC) without likelihood functions.”
Testing Model Specification in Approximate Bayesian Computation Using Asymptotic Properties
Hassan, A. R., & Frazier, D. T. (2024) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2024.2357630 · Cited by 2
“More efficient sampling schemes can also be implemented by replacing the accept/reject step with more informative proposals (Marjoram et al. 2003; Sisson, Fan, and Tanaka 2007; Beaumont et al. 2009); see chap.”
Model parameter estimation with imprecise information
Rauch, W. A., Rauch, N., & Kleidorfer, M. (2024) · Water Science & Technology · doi:10.2166/wst.2024.197 · Cited by 2
panelPomp: Analysis of Panel Data via Partially Observed Markov Processes in R
Bretó, C., Wheeler, J. J., King, A. A., & Ionides, E. L. (2025) · The R Journal · doi:10.32614/rj-2025-009 · Cited by 2
“The current version of panelPomp emphasizes plug-and-play methods (Bretó et al., 2009; He et al., 2010), also known as likelihood-free (Marjoram et al., 2003; Sisson et al., 2007), that are applicable to dynamic models for which a simulator is available even when the transition densities are…”
Höhna, S., & Catalán, A. (2025) · Molecular Ecology Resources · doi:10.1111/1755-0998.14087 · Cited by 2
“…individuals (Rasmussen et al. 2014; Kelleher et al. 2019), (iv) SNP-based methods using the site or allele frequency spectrum (Gutenkunst et al. 2009; Liu and Fu 2015), and (v) summary statistic-based methods using approximate Bayesian computation (ABC, Beaumont et al. 2002; Marjoram et al. 2003).”
EMBEDDED NONLOCAL OPERATOR REGRESSION (ENOR): QUANTIFYING MODEL ERROR IN LEARNING NONLOCAL OPERATORS
Fan, Y., Najm, H. N., Yu, Y., Silling, S. A., & D’Elia, M. (2025) · International Journal for Uncertainty Quantification · doi:10.1615/int.j.uncertaintyquantification.2025056958 · Cited by 2
Conn, P. B. (2025) · Environmetrics · doi:10.1002/env.70049 · Cited by 2
“The latter can potentially increase computational efficiency while still enabling parallelization (unlike ABC-MCMC).”
Chang, I., Fu, S.-J., Chen, C., Wang, T., & Hsiung, C. A. (2009) · Statistics in Biosciences · doi:10.1007/s12561-009-9008-z · Cited by 2
“In view of the fact that our algorithm requires the updates satisfying the compatibility condition so as to compute the likelihood, it seems a good idea to explore approximate Bayesian computation for the sampling of the posterior distribution; see [ 25 ], among others.”
MethodIndividual variation in stage duration in matrix population models: Problems and solutions
Lee, C.-C., & Okuyama, T. (2017) · Biological Control · doi:10.1016/j.biocontrol.2017.04.011 · Cited by 2
Hasegawa, T., Niida, A., Mori, T., Shimamura, T., Yamaguchi, R., Miyano, S., Akutsu, T., & Imoto, S. (2015) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2015.08.003 · Cited by 2
Approximating the likelihood of historical airline actions to evaluate airline delay cost functions
Bloem, M. J., Huang, H., & Bambos, N. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426333 · Cited by 2
“The problem under consideration in this paper is to find the delay cost functions and corresponding noise parameters that maximize the likelihood of airline actions in AFPs.”
BackgroundA Fast and Reliable Computational Method for Estimating Population Genetic Parameters
Vasco, D. A. (2008) · Genetics · doi:10.1534/genetics.108.087049 · Cited by 2
Wang, S., Shen, Y., Shi, C., Wang, T., Wei, Z., & Li, H. (2014) · The Scientific World JOURNAL · doi:10.1155/2014/625754 · Cited by 2
“In ABC methods, the evaluation of the likelihood is replaced by a simulation-based procedure [18–22].”
MethodOptimal parallelization of a sequential approximate Bayesian computation algorithm
Marin, J., Pudlo, P., & Sedki, M. (2012) · Winter Simulation Conference · doi:10.5555/2429759.2429796 · Cited by 2
Simulation-based Bayesian Analysis of Complex Data.
Marjoram, P., Hamblin, S., & Foley, B. R. (2015) · PubMed · Cited by 3
Self-citationStochastic Methods for Single Objective Global Optimization
Müller, C. L. (2014) · American Institute of Aeronautics and Astronautics eBooks · doi:10.2514/5.9781624102714.0063.0112 · Cited by 2
Condon, E., & Cukier, M. (2016) · Proceedings/Proceedings - International Symposium on Software Reliability Engineering · doi:10.1109/issre.2016.24 · Cited by 2
“A method for adapting MCMC estimation without the use of likelihood estimates (similar to ABC) is discussed in [16].”
MethodA Bayesian analysis of component life expectancy and its implications on the inspection schedule
Mason, P. (2017) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2017.01.006 · Cited by 2
Time-Series Filtering for Replicated Observations via a Kernel Approximate Bayesian Computation
Hasegawa, T., Kojima, K., Kawai, Y., & Nagasaki, M. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2872864 · Cited by 2
“Several extensions have been proposed that utilize primarily either the Markov chain Monte Carlo or sequential Monte Carlo (SMC) approaches [16]–[18].”
MethodLocal Kernel Dimension Reduction in Approximate Bayesian Computation
Zhou, J., & Fukumizu, K. (2018) · Open Journal of Statistics · doi:10.4236/ojs.2018.83031 · Cited by 2
“While the Markov Chain Monte Carlo methods find successes in applications where likelihood functions are known up to a unknown constant, MCMC can not be used in scenarios where likelihoods are intractable.”
BackgroundMethodInfluentialDoronina, O. A., Towery, C., & Hamlington, P. E. (2026) · Physics of Fluids · doi:10.1063/5.0316210 · Cited by 2
“[21], is based on the Metropolis-Hastings algorithm.”
Yadav, A., Nayak, S. R., & Mondal, S. (2021) · Journal of Petroleum Science and Engineering · doi:10.1016/j.petrol.2021.109566 · Cited by 2
Optimal parallelization of a sequential approximate Bayesian computation algorithm
Marin, J., Pudlo, P., & Sedki, M. (2012) · Winter Simulation Conference · doi:10.1109/wsc.2012.6465244 · Cited by 2
Geometric Variational Inference and Its Application to Bayesian Imaging
Frank, P. (2022) · International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering (MaxEnt) · doi:10.3390/psf2022005006 · Cited by 2
Vu, Q., Moores, M. T., & Zammit‐Mangion, A. (2023) · Bayesian Analysis · doi:10.1214/23-ba1400 · Cited by 6
Wang, M., Cao, W., Guo, Y., Wang, G., Jiang, J. W., Qiu, H., & Zhang, B. (2024) · Journal of Computational Biophysics and Chemistry · doi:10.1142/s2737416524400040 · Cited by 3
The Wreath Process: A totally generative model of geometric shape based on nested symmetriesPreprint
Borsa, D., Graepel, T., & Gordon, A. D. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.03041 · Cited by 2
“e). If the simulated data does not match the input data within a given tolerance, i.e. ˆ(D;D~ ) >, then the set of parameters will be rejected. This idea was particularized to MCMC simulations in [10] and [12]. Note that these require the specification of the threshold , which might require further inference. Howeve…”
BackgroundReverse Engineering Gene Networks Using Genomic Time-Course Data
Rau, A., Tel, H. I., Doerge, R. W., Craig, B. Α., Jaffrézic, F., Ghosh, J. K., & Qi, Y. (. (2010) · HAL · Cited by 4
Statistical inference in population genetics using microsatellites
Csilléry, K. (2009) · ERA · Cited by 2
Adaptive anchored inversion for Gaussian random fields using nonlinear data
Zhang, Z. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/12/125011 · Cited by 2
“There is a variant of MCMC called “approximate Bayesian computation (ABC)” [see Marjoram et al., 2003] that applies MCMC in problems without known likelihood functions.”
MethodAsymptotically exact conditional inference in deep generative models and differentiable simulatorsPreprint
Graham, M. M., & Storkey, A. (2016) · arXiv (Cornell University) · Cited by 2
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.