The reviewed record of science sign in
Pith

arxiv: 2203.16912 · v1 · pith:W2VLUCMT · submitted 2022-03-31 · cs.LG · cs.AI· stat.ML

MBORE: Multi-objective Bayesian Optimisation by Density-Ratio Estimation

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:W2VLUCMTrecord.jsonopen to challenge →

classification cs.LG cs.AIstat.ML
keywords optimisationbayesiandensity-ratioestimationmboremulti-objectiveproblemsacquisition
0
0 comments X
read the original abstract

Optimisation problems often have multiple conflicting objectives that can be computationally and/or financially expensive. Mono-surrogate Bayesian optimisation (BO) is a popular model-based approach for optimising such black-box functions. It combines objective values via scalarisation and builds a Gaussian process (GP) surrogate of the scalarised values. The location which maximises a cheap-to-query acquisition function is chosen as the next location to expensively evaluate. While BO is an effective strategy, the use of GPs is limiting. Their performance decreases as the problem input dimensionality increases, and their computational complexity scales cubically with the amount of data. To address these limitations, we extend previous work on BO by density-ratio estimation (BORE) to the multi-objective setting. BORE links the computation of the probability of improvement acquisition function to that of probabilistic classification. This enables the use of state-of-the-art classifiers in a BO-like framework. In this work we present MBORE: multi-objective Bayesian optimisation by density-ratio estimation, and compare it to BO across a range of synthetic and real-world benchmarks. We find that MBORE performs as well as or better than BO on a wide variety of problems, and that it outperforms BO on high-dimensional and real-world problems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.