FunBO: Discovering Acquisition Functions for Bayesian Optimization with FunSearch
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910507371331584 |
|---|---|
| author | Aglietti, Virginia Ktena, Ira Schrouff, Jessica Sgouritsa, Eleni Ruiz, Francisco J. R. Malek, Alan Bellot, Alexis Chiappa, Silvia |
| author_facet | Aglietti, Virginia Ktena, Ira Schrouff, Jessica Sgouritsa, Eleni Ruiz, Francisco J. R. Malek, Alan Bellot, Alexis Chiappa, Silvia |
| contents | The sample efficiency of Bayesian optimization algorithms depends on carefully crafted acquisition functions (AFs) guiding the sequential collection of function evaluations. The best-performing AF can vary significantly across optimization problems, often requiring ad-hoc and problem-specific choices. This work tackles the challenge of designing novel AFs that perform well across a variety of experimental settings. Based on FunSearch, a recent work using Large Language Models (LLMs) for discovery in mathematical sciences, we propose FunBO, an LLM-based method that can be used to learn new AFs written in computer code by leveraging access to a limited number of evaluations for a set of objective functions. We provide the analytic expression of all discovered AFs and evaluate them on various global optimization benchmarks and hyperparameter optimization tasks. We show how FunBO identifies AFs that generalize well in and out of the training distribution of functions, thus outperforming established general-purpose AFs and achieving competitive performance against AFs that are customized to specific function types and are learned via transfer-learning algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_04824 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | FunBO: Discovering Acquisition Functions for Bayesian Optimization with FunSearch Aglietti, Virginia Ktena, Ira Schrouff, Jessica Sgouritsa, Eleni Ruiz, Francisco J. R. Malek, Alan Bellot, Alexis Chiappa, Silvia Machine Learning The sample efficiency of Bayesian optimization algorithms depends on carefully crafted acquisition functions (AFs) guiding the sequential collection of function evaluations. The best-performing AF can vary significantly across optimization problems, often requiring ad-hoc and problem-specific choices. This work tackles the challenge of designing novel AFs that perform well across a variety of experimental settings. Based on FunSearch, a recent work using Large Language Models (LLMs) for discovery in mathematical sciences, we propose FunBO, an LLM-based method that can be used to learn new AFs written in computer code by leveraging access to a limited number of evaluations for a set of objective functions. We provide the analytic expression of all discovered AFs and evaluate them on various global optimization benchmarks and hyperparameter optimization tasks. We show how FunBO identifies AFs that generalize well in and out of the training distribution of functions, thus outperforming established general-purpose AFs and achieving competitive performance against AFs that are customized to specific function types and are learned via transfer-learning algorithms. |
| title | FunBO: Discovering Acquisition Functions for Bayesian Optimization with FunSearch |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2406.04824 |