Optimal proposals for Approximate Bayesian Computation
read the original abstract
We derive the optimal proposal density for Approximate Bayesian Computation (ABC) using Sequential Monte Carlo (SMC) (or Population Monte Carlo, PMC). The criterion for optimality is that the SMC/PMC-ABC sampler maximise the effective number of samples per parameter proposal. The optimal proposal density represents the optimal trade-off between favoring high acceptance rate and reducing the variance of the importance weights of accepted samples. We discuss two convenient approximations of this proposal and show that the optimal proposal density gives a significant boost in the expected sampling efficiency compared to standard kernels that are in common use in the ABC literature, especially as the number of parameters increases.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Dark Energy Survey Year 3 results: optimized $w$CDM simulation-based inference with weak lensing map-level hybrid statistics
DES Y3 weak lensing analysis with hybrid map-level statistics and simulation-based inference yields S8 = 0.808 ± 0.017, Ωm = 0.325 ± 0.024, and w < -0.766, improving the figure of merit by 60% over prior state-of-the-art.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.