A note on approximating ABC-MCMC using flexible classifiers

DOI10.1002/STA4.56MaRDI QIDQ6537793zbMATH OpenFDO

Authors Kim Cuc Pham, David J. Nott, Sanjay Chaudhuri

Publication date 14 May 2024

Published in Stat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/STA4.56

zbMATH Keywords

approximate Bayesian computationBayesian inferenceclassificationsynthetic likelihood

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• An adaptive Metropolis algorithm
• Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation. With discussion and authors' reply
• Empirical likelihood
• Handbook of Markov Chain Monte Carlo
• scientific article; zbMATH DE number 2118472 (Why is no real title available?)
• scientific article; zbMATH DE number 835699 (Why is no real title available?)
• Inference for Stereological Extremes
• Likelihood-free Bayesian estimation of multivariate quantile distributions
• Random forests
• Robustness of ranking and selection rules using generalised \(g\)-and-\(k\) distributions
• Sequential Monte Carlo without likelihoods
• The Elements of Statistical Learning
• The largest inclusions in a piece of steel

Cited in

(2)

• Black-box Bayesian inference for agent-based models
• Sequential Monte Carlo ABC: an overview with application to COVID-19 data

This page was built for publication: A note on approximating ABC-MCMC using flexible classifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6537793)