Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces
Abstract
Impactful applications such as materials discovery, hardware design, neural architecture search, or portfolio optimization require optimizing high-dimensional black-box functions with mixed and combinatorial input spaces.While Bayesian optimization has recently made significant progress in solving such problems, an in-depth analysis reveals that the current state-of-the-art methods are not reliable. Their performances degrade substantially when the unknown optima of the function do not have a certain structure. To fill the need for a reliable algorithm for combinatorial and mixed spaces, this paper proposes Bounce that relies on a novel map of various variable types into nested embeddings of increasing dimensionality.Comprehensive experiments show that Bounce reliably achieves and often even improves upon state-of-the-art performance on a variety of high-dimensional problems.
Cite
Text
Papenmeier et al. "Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces." Neural Information Processing Systems, 2023.Markdown
[Papenmeier et al. "Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces." Neural Information Processing Systems, 2023.](https://mlanthology.org/neurips/2023/papenmeier2023neurips-bounce/)BibTeX
@inproceedings{papenmeier2023neurips-bounce,
title = {{Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces}},
author = {Papenmeier, Leonard and Nardi, Luigi and Poloczek, Matthias},
booktitle = {Neural Information Processing Systems},
year = {2023},
url = {https://mlanthology.org/neurips/2023/papenmeier2023neurips-bounce/}
}