
























Abstract:Bayesian optimization (BO) is a widely used iterative black-box optimization method that utilizes Gaussian process (GP) surrogate models. In practice, BO is typically terminated after a fixed evaluation budget is exhausted, which can incur unnecessary cost and provides no optimality guarantee on solution quality. Recent research in developing a practical stopping criterion has made empirical progress, yet a theoretically sound stopping criterion remains a work in progress. In this work, we present provably tighter instantaneous regret bounds for GP upper confidence bound (GP-UCB) at any given iteration. Then, we propose stopping criteria for GP-UCB based on this tighter bound that ensures an $\epsilon$-optimal solution with high probability $1-\delta$ upon termination. Numerical experiments are performed to validate and demonstrate the effectiveness and efficiency of our stopping criteria.
| Comments: | 21 pages |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.22561 [cs.LG] |
| (or arXiv:2605.22561v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.22561 arXiv-issued DOI via DataCite (pending registration) |
From: Qiyu Wei [view email]
[v1]
Thu, 21 May 2026 14:42:31 UTC (55 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。