Respecting the limit:Bayesian optimization with a bound on the optimal value

Hanyang Wang, Juergen Branke, Matthias Poloczek
11/7/2024
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

In many real-world optimization problems, we have prior information about what objective function values are achievable. In this paper, we study the scenario that we have either exact knowledge of the minimum value or a, possibly inexact, lower bound on its value. We propose bound-aware Bayesian optimization (BABO), a Bayesian optimization method that uses a new surrogate model and acquisition function to utilize such prior information. We present SlogGP, a new surrogate model that incorporates bound information and adapts the Expected Improvement (EI) acquisition function accordingly. Empirical results on a variety of benchmarks demonstrate the benefit of taking prior information about the optimal value into account, and that the proposed approach significantly outperforms existing techniques. Furthermore, we notice that even in the absence of prior information on the bound, the proposed SlogGP surrogate model still performs better than the standard GP model in most cases, which we explain by its larger expressiveness.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wang2024respecting,
  title  = {Respecting the limit:Bayesian optimization with a bound on the optimal value},
  author = {Hanyang Wang and Juergen Branke and Matthias Poloczek},
  year   = {2024},
  eprint = {2411.04744},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.04744v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.04744.svg)](https://codeofpaper.com/paper/2411.04744)

Discussion