Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2302.01310 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913713304371200 |
|---|---|
| author | Buckingham, Jack M. Gonzalez, Sebastian Rojas Branke, Juergen |
| author_facet | Buckingham, Jack M. Gonzalez, Sebastian Rojas Branke, Juergen |
| contents | Multi-objective Bayesian optimization aims to find the Pareto front of trade-offs between a set of expensive objectives while collecting as few samples as possible. In some cases, it is possible to evaluate the objectives separately, and a different latency or evaluation cost can be associated with each objective. This decoupling of the objectives presents an opportunity to learn the Pareto front faster by avoiding unnecessary, expensive evaluations. We propose a scalarization based knowledge gradient acquisition function which accounts for the different evaluation costs of the objectives. We prove asymptotic consistency of the estimator of the optimum for an arbitrary, D-dimensional, real compact search space and show empirically that the algorithm performs comparably with the state of the art and significantly outperforms versions which always evaluate both objectives. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_01310 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Knowledge Gradient for Multi-Objective Bayesian Optimization with Decoupled Evaluations Buckingham, Jack M. Gonzalez, Sebastian Rojas Branke, Juergen Machine Learning Optimization and Control Multi-objective Bayesian optimization aims to find the Pareto front of trade-offs between a set of expensive objectives while collecting as few samples as possible. In some cases, it is possible to evaluate the objectives separately, and a different latency or evaluation cost can be associated with each objective. This decoupling of the objectives presents an opportunity to learn the Pareto front faster by avoiding unnecessary, expensive evaluations. We propose a scalarization based knowledge gradient acquisition function which accounts for the different evaluation costs of the objectives. We prove asymptotic consistency of the estimator of the optimum for an arbitrary, D-dimensional, real compact search space and show empirically that the algorithm performs comparably with the state of the art and significantly outperforms versions which always evaluate both objectives. |
| title | Knowledge Gradient for Multi-Objective Bayesian Optimization with Decoupled Evaluations |
| topic | Machine Learning Optimization and Control |
| url | https://arxiv.org/abs/2302.01310 |