Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Efficient acquisition rules for model-based approximate Bayesian computation (1704.00520v3)

Published 3 Apr 2017 in stat.ML, stat.CO, and stat.ME

Abstract: Approximate Bayesian computation (ABC) is a method for Bayesian inference when the likelihood is unavailable but simulating from the model is possible. However, many ABC algorithms require a large number of simulations, which can be costly. To reduce the computational cost, Bayesian optimisation (BO) and surrogate models such as Gaussian processes have been proposed. Bayesian optimisation enables one to intelligently decide where to evaluate the model next but common BO strategies are not designed for the goal of estimating the posterior distribution. Our paper addresses this gap in the literature. We propose to compute the uncertainty in the ABC posterior density, which is due to a lack of simulations to estimate this quantity accurately, and define a loss function that measures this uncertainty. We then propose to select the next evaluation location to minimise the expected loss. Experiments show that the proposed method often produces the most accurate approximations as compared to common BO strategies.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Marko Järvenpää (10 papers)
  2. Michael U. Gutmann (33 papers)
  3. Arijus Pleska (1 paper)
  4. Aki Vehtari (99 papers)
  5. Pekka Marttinen (56 papers)
Citations (66)

Summary

We haven't generated a summary for this paper yet.