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:2502. 01226v4 Announce Type: replace Abstract: Gaussian process (GP) bandits provide a powerful framework for performing blackbox optimization of unknown functions.
By Jack Sandberg, Morteza Haghir Chehreghani
arXiv:2605. 20145v2 Announce Type: replace-cross Abstract: Gaussian process (GP) predictive distributions are commonly used in Bayesian optimization (BO) to guide the selection of evaluation points for expensive objective functions.
By Aur\'elien Pion, Emmanuel Vazquez
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:2307. 03587v4 Announce Type: replace Abstract: In non-stationary linear contextual bandits, existing efficient algorithms typically rely on the Weighted Regularized Least-Squares (WRLS) estimator.
By Nicklas Werge, Yi-Shan Wu, Abdullah Akg\"ul, Melih Kandemir
arXiv:2603. 09276v2 Announce Type: replace-cross Abstract: We study a widely used Bayesian optimization method, Gaussian process Thompson sampling (GP-TS), under the assumption that the objective function is a sample path from a GP.
By Shion Takeno, Shogo Iwazaki