Approximate Bayesian Computation with Domain Expert in the Loop

Loading...
Thumbnail Image

Access rights

openAccess

URL

Journal Title

Journal ISSN

Volume Title

A4 Artikkeli konferenssijulkaisussa

Date

2022

Major/Subject

Mcode

Degree programme

Language

en

Pages

1893-1905

Series

Proceedings of the 39th International Conference on Machine Learning, Proceedings of Machine Learning Research, Volume 162

Abstract

Approximate Bayesian computation (ABC) is a popular likelihood-free inference method for models with intractable likelihood functions. As ABC methods usually rely on comparing summary statistics of observed and simulated data, the choice of the statistics is crucial. This choice involves a trade-off between loss of information and dimensionality reduction, and is often determined based on domain knowledge. However, handcrafting and selecting suitable statistics is a laborious task involving multiple trial-and-error steps. In this work, we introduce an active learning method for ABC statistics selection which reduces the domain expert’s work considerably. By involving the experts, we are able to handle misspecified models, unlike the existing dimension reduction methods. Moreover, empirical results show better posterior estimates than with existing methods, when the simulation budget is limited.

Description

Keywords

Other note

Citation

Bharti, A, Filstroff, L & Kaski, S 2022, Approximate Bayesian Computation with Domain Expert in the Loop . in Proceedings of the 39th International Conference on Machine Learning . Proceedings of Machine Learning Research, vol. 162, JMLR, pp. 1893-1905, International Conference on Machine Learning, Baltimore, Maryland, United States, 17/07/2022 . < https://proceedings.mlr.press/v162/bharti22a.html >