arXiv:2601. 07094v2 Announce Type: replace-cross Abstract: Bayesian optimization (BO) iteratively fits a Gaussian process (GP) surrogate to accumulated evaluations and selects new queries via an acquisition function.
By Jiguang Li, Hengrui Luo
arXiv:2608.29349v1 Announce Type: new
Abstract: Gaussian process (GP) regression with a single global GP (GP-glo) incurs cubic computational cost, limiting scalability to large datasets. Product-of-e...
By Yean Hoon Ong, Paolo Barucca, Wei Pan, Jun Wang
arXiv:2610.10186v1 Announce Type: new
Abstract: Bayesian optimization (BO) is widely used as a standard approach for expensive black-box optimization. However, BO algorithms often involve parameters...
By Satoshi Katayama, Shoyo Hunt, Shintaro Masuda, Masayuki Karasuyama
arXiv:2608. 13793v1 Announce Type: cross Abstract: Machine learning (ML) has become an indispensable part of modern engineering design workflows.
By Tyler R. Johnson, Kian Ben-Jacob, Christopher P. Muller, Ramin Bostanabad
The paper introduces Finite-Library Input-Warped Bayesian Optimization (FLIWBO), a method that selects input warps from a finite library to adapt the geometry used by Gaussian‑process Bayesian optimization. FLIWBO maintains high‑probability convergence guarantees while improving sample efficiency on problems where raw coordinates poorly match the objective’s geometry, such as log‑scaled hyperparameters or localized peaks. Experiments on synthetic benchmarks, Fashion‑MNIST hyperparameter tuning, and a 20‑dimensional multi‑agent system design demonstrate that FLIWBO‑UCB outperforms raw‑coordinate GP‑UCB and other methods with regret guarantees, especially under misspecified geometry.
By Edvin Ketabati Augustinsson, Robert A. Bridges
arXiv:2610.19925v1 Announce Type: cross
Abstract: Efficient global optimization aims to identify a global optimum of an expensive black-box function within a limited evaluation budget $N$. We investi...
By Haowei Wang, Yilin Zheng
arXiv:2610.08969v1 Announce Type: new
Abstract: Black-box optimization problems are ubiquitous across science and engineering, often dealing with expensive objective functions. This objective latency...
By Gustavo Sutter, Alejandro Comas-Leon, David Holzm\"uller, Hao Wang, Luis Ricardez-Sandoval, Pascal Poupart, Agustinus Kristiadi
arXiv:2610.03201v1 Announce Type: cross
Abstract: Gaussian Processes (GPs) are a powerful tool for modelling and quantifying uncertainty in functional relationships. However, they require practitione...
By Callum Lau, Jeremias Knoblauch, Louis Sharrock
arXiv:2607. 04356v1 Announce Type: new Abstract: Bayesian Optimization (BO) generally begins with an initialization phase: a batch of $n_0$ uninformed evaluations.
By Mujin Cheon, James Odgers, Dong-Yeun Koh, Calvin Tsay
The paper introduces Gradient-based Sample Selection Bayesian Optimization (GSSBO), a method that builds the Gaussian process surrogate on a strategically chosen subset of samples rather than the full dataset. By using gradient information to eliminate redundant points while keeping diversity and representativeness, GSSBO achieves sublinear regret bounds and reduces the cubic computational cost of standard BO. Experiments on synthetic and real-world tasks show that this approach maintains comparable optimization performance while significantly cutting GP fitting time and resource usage.
By Qiyu Wei, Haowei Wang, Zirui Cao, Songhao Wang, Richard Allmendinger, Mauricio A \'Alvarez
arXiv:2605.22561v2 Announce Type: replace
Abstract: Bayesian optimization (BO) is a widely used iterative black-box optimization method that utilizes Gaussian process (GP) surrogate models. In practi...
By Haowei Wang, Jingyi Wang, Qiyu Wei
arXiv:2602.07144v3 Announce Type: replace
Abstract: Bayesian optimization (BO) is a popular technique for sample-efficient optimization of black-box functions. In many applications, the parameters be...
By Samuel Daulton, David Eriksson, Maximilian Balandat, Eytan Bakshy