A note on approximating ABC-MCMC using flexible classifiers

DOI10.1002/sta4.56MaRDI QIDQ6537793

Sanjay Chaudhuri, David J. Nott, Kim Cuc Pham

Publication date: 14 May 2024

Published in: Stat (Search for Journal in Brave)

zbMATH Keywords

classificationBayesian inferenceapproximate Bayesian computationsynthetic likelihood

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robustness of ranking and selection rules using generalised \(g\)-and-\(k\) distributions
• The largest inclusions in a piece of steel
• Likelihood-free Bayesian estimation of multivariate quantile distributions
• Handbook of Markov Chain Monte Carlo
• Constructing Summary Statistics for Approximate Bayesian Computation: Semi-Automatic Approximate Bayesian Computation
• Inference for Stereological Extremes
• Sequential Monte Carlo without likelihoods
• An adaptive Metropolis algorithm
• Random forests
• The Elements of Statistical Learning

Related Items (1)

Black-box Bayesian inference for agent-based models

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