pith. sign in

arxiv: 1004.1112 · v2 · pith:REIUPBOPnew · submitted 2010-04-07 · 📊 stat.ME · stat.CO

Constructing Summary Statistics for Approximate Bayesian Computation: Semi-automatic ABC

classification 📊 stat.ME stat.CO
keywords statisticssummarydatainferencemodelsaccurateapproximatebayesian
0
0 comments X
read the original abstract

Many modern statistical applications involve inference for complex stochastic models, where it is easy to simulate from the models, but impossible to calculate likelihoods. Approximate Bayesian computation (ABC) is a method of inference for such models. It replaces calculation of the likelihood by a step which involves simulating artificial data for different parameter values, and comparing summary statistics of the simulated data to summary statistics of the observed data. Here we show how to construct appropriate summary statistics for ABC in a semi-automatic manner. We aim for summary statistics which will enable inference about certain parameters of interest to be as accurate as possible. Theoretical results show that optimal summary statistics are the posterior means of the parameters. While these cannot be calculated analytically, we use an extra stage of simulation to estimate how the posterior means vary as a function of the data; and then use these estimates of our summary statistics within ABC. Empirical results show that our approach is a robust method for choosing summary statistics, that can result in substantially more accurate ABC analyses than the ad-hoc choices of summary statistics proposed in the literature. We also demonstrate advantages over two alternative methods of simulation-based inference.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Simulation-Based Inference for Cluster Cosmology with Set-Based Neural Network Architectures

    astro-ph.CO 2026-06 unverdicted novelty 6.0

    SBI framework with GNN-on-sets and masked autoregressive flow recovers input cosmologies from eRASS1 mocks at 11.5% precision on Ω_m and 4.4% on σ_8 using 3259 clusters.