Learning Summary Statistic for Approximate Bayesian Computation via Deep Neural Network
Authors:
Preprint
Abstract
Approximate Bayesian Computation (ABC) methods are used to approximate posterior distributions in models with unknown or computationally intractable likelihoods. Both the accuracy and computational efficiency of ABC depend on the choice of summary statistic, but outside of special cases where the optimal summary statistics are known, it is unclear which guiding principles can be used to construct effective summary statistics. In this paper we explore the possibility of automating the process of constructing summary statistics by training deep neural networks to predict the parameters from artificially generated data: the resulting summary statistics are approximately posterior means of the parameters. With minimal model-specific tuning, our method constructs summary statistics for the Ising model and the moving-average model, which match or exceed theoretically-motivated summary statistics in terms of the accuracies of the resulting posteriors.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Approximate Bayesian computational methodsStatistics and Computing, 2011
- ABC: A useful Bayesian tool for the analysis of population dataInfection, Genetics and Evolution, 2010
- Approximate Bayesian Computation (ABC) in practiceTrends in Ecology & Evolution, 2010
- Non-linear regression models for Approximate Bayesian ComputationStatistics and Computing, 2009
- Sequential Monte Carlo without likelihoodsProceedings of the National Academy of Sciences, 2007
- Markov chain Monte Carlo without likelihoodsProceedings of the National Academy of Sciences, 2003
- Approximate Bayesian Computation in Population GeneticsGenetics, 2002
- Theory of Point Estimation1998
- Estimating the age of the common ancestor of a sample of DNA sequencesMolecular Biology and Evolution, 1997
- Inferring Coalescence Times From DNA Sequence DataGenetics, 1997