English

Automated Model Selection with Bayesian Quadrature

Machine Learning 2019-03-04 v3 Machine Learning

Abstract

We present a novel technique for tailoring Bayesian quadrature (BQ) to model selection. The state-of-the-art for comparing the evidence of multiple models relies on Monte Carlo methods, which converge slowly and are unreliable for computationally expensive models. Previous research has shown that BQ offers sample efficiency superior to Monte Carlo in computing the evidence of an individual model. However, applying BQ directly to model comparison may waste computation producing an overly-accurate estimate for the evidence of a clearly poor model. We propose an automated and efficient algorithm for computing the most-relevant quantity for model selection: the posterior probability of a model. Our technique maximizes the mutual information between this quantity and observations of the models' likelihoods, yielding efficient acquisition of samples across disparate model spaces when likelihood observations are limited. Our method produces more-accurate model posterior estimates using fewer model likelihood evaluations than standard Bayesian quadrature and Monte Carlo estimators, as we demonstrate on synthetic and real-world examples.

Keywords

Cite

@article{arxiv.1902.09724,
  title  = {Automated Model Selection with Bayesian Quadrature},
  author = {Henry Chai and Jean-Francois Ton and Roman Garnett and Michael A. Osborne},
  journal= {arXiv preprint arXiv:1902.09724},
  year   = {2019}
}

Comments

10 pages, 5 figures. Currently in submission to ICML 2019

R2 v1 2026-06-23T07:51:11.783Z