BORE: Bayesian Optimization by Density-Ratio Estimation
Abstract
Bayesian optimization (BO) is among the most effective and widely-used blackbox optimization methods. BO proposes solutions according to an explore-exploit trade-off criterion encoded in an acquisition function, many of which are computed from the posterior predictive of a probabilistic surrogate model. Prevalent among these is the expected improvement (EI). The need to ensure analytical tractability of the predictive often poses limitations that can hinder the efficiency and applicability of BO. In this paper, we cast the computation of EI as a binary classification problem, building on the link between class-probability estimation and density-ratio estimation, and the lesser-known link between density-ratios and EI. By circumventing the tractability constraints, this reformulation provides numerous advantages, not least in terms of expressiveness, versatility, and scalability.
Cite
Text
Tiao et al. "BORE: Bayesian Optimization by Density-Ratio Estimation." International Conference on Machine Learning, 2021.Markdown
[Tiao et al. "BORE: Bayesian Optimization by Density-Ratio Estimation." International Conference on Machine Learning, 2021.](https://mlanthology.org/icml/2021/tiao2021icml-bore/)BibTeX
@inproceedings{tiao2021icml-bore,
title = {{BORE: Bayesian Optimization by Density-Ratio Estimation}},
author = {Tiao, Louis C and Klein, Aaron and Seeger, Matthias W and Bonilla, Edwin V. and Archambeau, Cedric and Ramos, Fabio},
booktitle = {International Conference on Machine Learning},
year = {2021},
pages = {10289-10300},
volume = {139},
url = {https://mlanthology.org/icml/2021/tiao2021icml-bore/}
}