Robust Entropy Search for Safe Efficient Bayesian Optimization

Dorina Weichert, Alexander Kister, Sebastian Houben, Patrick Link, Gunar Ernis
5/29/2024
cs.LGstat.ML

No official code found. Best implementation: fraunhofer-iais/Robust-Entropy-Search (1 star, AGPL-3.0, last commit 2024-05-29).

Abstract

The practical use of Bayesian Optimization (BO) in engineering applications imposes special requirements: high sampling efficiency on the one hand and finding a robust solution on the other hand. We address the case of adversarial robustness, where all parameters are controllable during the optimization process, but a subset of them is uncontrollable or even adversely perturbed at the time of application. To this end, we develop an efficient information-based acquisition function that we call Robust Entropy Search (RES). We empirically demonstrate its benefits in experiments on synthetic and real-life data. The results showthat RES reliably finds robust optima, outperforming state-of-the-art algorithms.

View on arXivView PDF

Code Implementations(1)

AGPL-3.0

This is the companion code for the publication "Robust Entropy Search for Safe Efficient Bayesian Optimization", by D. Weichert et al., UAI 2024.

10Python, Jupyter NotebookMay 29, 20242 years agoAGPL-3.0

Similar Papers

Cite this paper

@article{weichert2024robust,
  title  = {Robust Entropy Search for Safe Efficient Bayesian Optimization},
  author = {Dorina Weichert and Alexander Kister and Sebastian Houben and Patrick Link and Gunar Ernis},
  year   = {2024},
  eprint = {2405.19059},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.19059v2}
}

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/2405.19059.svg)](https://codeofpaper.com/paper/2405.19059)

Discussion