guest ::
| Home > Publications database > Deterministic Global Optimization of the Acquisition Function in Bayesian Optimization: To Do or Not To Do? > print |
| Home > Publications database > Deterministic Global Optimization of the Acquisition Function in Bayesian Optimization: To Do or Not To Do? > print |
| 001 | 1044210 | ||
| 005 | 20250717202256.0 | ||
| 024 | 7 | _ | |a 10.48550/ARXIV.2503.03625 |2 doi |
| 037 | _ | _ | |a FZJ-2025-03099 |
| 100 | 1 | _ | |a Georgiou, Anastasia |0 P:(DE-HGF)0 |b 0 |
| 245 | _ | _ | |a Deterministic Global Optimization of the Acquisition Function in Bayesian Optimization: To Do or Not To Do? |
| 260 | _ | _ | |c 2025 |b arXiv |
| 336 | 7 | _ | |a Preprint |b preprint |m preprint |0 PUB:(DE-HGF)25 |s 1752733729_21639 |2 PUB:(DE-HGF) |
| 336 | 7 | _ | |a WORKING_PAPER |2 ORCID |
| 336 | 7 | _ | |a Electronic Article |0 28 |2 EndNote |
| 336 | 7 | _ | |a preprint |2 DRIVER |
| 336 | 7 | _ | |a ARTICLE |2 BibTeX |
| 336 | 7 | _ | |a Output Types/Working Paper |2 DataCite |
| 520 | _ | _ | |a Bayesian Optimization (BO) with Gaussian Processes relies on optimizing an acquisition function to determine sampling. We investigate the advantages and disadvantages of using a deterministic global solver (MAiNGO) compared to conventional local and stochastic global solvers (L-BFGS-B and multi-start, respectively) for the optimization of the acquisition function. For CPU efficiency, we set a time limit for MAiNGO, taking the best point as optimal. We perform repeated numerical experiments, initially using the Muller-Brown potential as a benchmark function, utilizing the lower confidence bound acquisition function; we further validate our findings with three alternative benchmark functions. Statistical analysis reveals that when the acquisition function is more exploitative (as opposed to exploratory), BO with MAiNGO converges in fewer iterations than with the local solvers. However, when the dataset lacks diversity, or when the acquisition function is overly exploitative, BO with MAiNGO, compared to the local solvers, is more likely to converge to a local rather than a global ly near-optimal solution of the black-box function. L-BFGS-B and multi-start mitigate this risk in BO by introducing stochasticity in the selection of the next sampling point, which enhances the exploration of uncharted regions in the search space and reduces dependence on acquisition function hyperparameters. Ultimately, suboptimal optimization of poorly chosen acquisition functions may be preferable to their optimal solution. When the acquisition function is more exploratory, BO with MAiNGO, multi-start, and L-BFGS-B achieve comparable probabilities of convergence to a globally near-optimal solution (although BO with MAiNGO may require more iterations to converge under these conditions). |
| 536 | _ | _ | |a 899 - ohne Topic (POF4-899) |0 G:(DE-HGF)POF4-899 |c POF4-899 |f POF IV |x 0 |
| 588 | _ | _ | |a Dataset connected to DataCite |
| 650 | _ | 7 | |a Optimization and Control (math.OC) |2 Other |
| 650 | _ | 7 | |a Machine Learning (cs.LG) |2 Other |
| 650 | _ | 7 | |a FOS: Mathematics |2 Other |
| 650 | _ | 7 | |a FOS: Computer and information sciences |2 Other |
| 700 | 1 | _ | |a Jungen, Daniel |0 P:(DE-HGF)0 |b 1 |
| 700 | 1 | _ | |a Kaven, Luise |0 P:(DE-HGF)0 |b 2 |
| 700 | 1 | _ | |a Hunstig, Verena |0 P:(DE-HGF)0 |b 3 |
| 700 | 1 | _ | |a Frangakis, Constantine |0 P:(DE-HGF)0 |b 4 |
| 700 | 1 | _ | |a Kevrekidis, Ioannis |0 P:(DE-HGF)0 |b 5 |
| 700 | 1 | _ | |a Mitsos, Alexander |0 P:(DE-Juel1)172025 |b 6 |e Corresponding author |u fzj |
| 773 | _ | _ | |a 10.48550/ARXIV.2503.03625 |
| 909 | C | O | |o oai:juser.fz-juelich.de:1044210 |p VDB |
| 910 | 1 | _ | |a Johns Hopkins University |0 I:(DE-HGF)0 |b 0 |6 P:(DE-HGF)0 |
| 910 | 1 | _ | |a RWTH Aachen |0 I:(DE-588b)36225-6 |k RWTH |b 1 |6 P:(DE-HGF)0 |
| 910 | 1 | _ | |a RWTH Aachen |0 I:(DE-588b)36225-6 |k RWTH |b 2 |6 P:(DE-HGF)0 |
| 910 | 1 | _ | |a RWTH Aachen |0 I:(DE-588b)36225-6 |k RWTH |b 3 |6 P:(DE-HGF)0 |
| 910 | 1 | _ | |a Johns Hopkins University |0 I:(DE-HGF)0 |b 4 |6 P:(DE-HGF)0 |
| 910 | 1 | _ | |a Johns Hopkins University |0 I:(DE-HGF)0 |b 5 |6 P:(DE-HGF)0 |
| 910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 6 |6 P:(DE-Juel1)172025 |
| 910 | 1 | _ | |a RWTH Aachen |0 I:(DE-588b)36225-6 |k RWTH |b 6 |6 P:(DE-Juel1)172025 |
| 913 | 1 | _ | |a DE-HGF |b Programmungebundene Forschung |l ohne Programm |1 G:(DE-HGF)POF4-890 |0 G:(DE-HGF)POF4-899 |3 G:(DE-HGF)POF4 |2 G:(DE-HGF)POF4-800 |4 G:(DE-HGF)POF |v ohne Topic |x 0 |
| 914 | 1 | _ | |y 2025 |
| 920 | _ | _ | |l yes |
| 920 | 1 | _ | |0 I:(DE-Juel1)ICE-1-20170217 |k ICE-1 |l Modellierung von Energiesystemen |x 0 |
| 980 | _ | _ | |a preprint |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a I:(DE-Juel1)ICE-1-20170217 |
| 980 | _ | _ | |a UNRESTRICTED |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|