English

Approximate Bayesian Computation via Population Monte Carlo and Classification

Machine Learning 2019-12-03 v2 Machine Learning

Abstract

Approximate Bayesian computation (ABC) methods can be used to sample from posterior distributions when the likelihood function is unavailable or intractable, as is often the case in biological systems. ABC methods suffer from inefficient particle proposals in high dimensions, and subjectivity in the choice of summary statistics, discrepancy measure, and error tolerance. Sequential Monte Carlo (SMC) methods have been combined with ABC to improve the efficiency of particle proposals, but suffer from subjectivity and require many simulations from the likelihood function. Likelihood-Free Inference by Ratio Estimation (LFIRE) leverages classification to estimate the posterior density directly but does not explore the parameter space efficiently. This work proposes a classification approach that approximates population Monte Carlo (PMC), where model class probabilities from classification are used to update particle weights. This approach, called Classification-PMC, blends adaptive proposals and classification, efficiently producing samples from the posterior without subjectivity. We show through a simulation study that Classification-PMC outperforms two state-of-the-art methods: ratio estimation and SMC ABC when it is computationally difficult to simulate from the likelihood.

Keywords

Cite

@article{arxiv.1810.12233,
  title  = {Approximate Bayesian Computation via Population Monte Carlo and Classification},
  author = {Charlie Rogers-Smith and Henri Pesonen and Samuel Kaski},
  journal= {arXiv preprint arXiv:1810.12233},
  year   = {2019}
}

Comments

18 pages, 5 figures

R2 v1 2026-06-23T04:56:12.208Z