Bayesian Optimization with Lower Confidence Bounds for Minimization Problems with Known Outer Structure
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909541019418624 |
|---|---|
| author | Baumgärtner, Katrin Diehl, Moritz |
| author_facet | Baumgärtner, Katrin Diehl, Moritz |
| contents | This paper considers Bayesian optimization (BO) for problems with known outer problem structure. In contrast to the classic BO setting, where the objective function itself is unknown and needs to be iteratively estimated from noisy observations, we analyze the case where the objective has a known outer structure - given in terms of a loss function - while the inner structure - an unknown input-output model - is again iteratively estimated from noisy observations of the model outputs. We introduce a novel lower confidence bound algorithm for this particular problem class which exploits the known outer problem structure. The proposed method is analyzed in terms of regret for the special case of convex loss functions and probabilistic parametric models which are linear in the uncertain parameters. Numerical examples illustrate the superior performance of structure-exploiting methods compared to structure-agnostic approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_14015 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bayesian Optimization with Lower Confidence Bounds for Minimization Problems with Known Outer Structure Baumgärtner, Katrin Diehl, Moritz Optimization and Control This paper considers Bayesian optimization (BO) for problems with known outer problem structure. In contrast to the classic BO setting, where the objective function itself is unknown and needs to be iteratively estimated from noisy observations, we analyze the case where the objective has a known outer structure - given in terms of a loss function - while the inner structure - an unknown input-output model - is again iteratively estimated from noisy observations of the model outputs. We introduce a novel lower confidence bound algorithm for this particular problem class which exploits the known outer problem structure. The proposed method is analyzed in terms of regret for the special case of convex loss functions and probabilistic parametric models which are linear in the uncertain parameters. Numerical examples illustrate the superior performance of structure-exploiting methods compared to structure-agnostic approaches. |
| title | Bayesian Optimization with Lower Confidence Bounds for Minimization Problems with Known Outer Structure |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2503.14015 |