arXiv Machine Learning

Local Constrained Bayesian Optimization

arXiv:2603. 07965v2 Announce Type: replace-cross Abstract: Bayesian optimization (BO) for high-dimensional constrained problems remains a significant challenge due to the curse of dimensionality.

arXiv Machine Learning
Sep 25

MF-SCBO : Multi-fidelity Scalable Constrained Bayesian Optimization

MF-SCBO is a new multi‑fidelity extension of Scalable Constrained Bayesian Optimization designed for high‑dimensional black‑box functions with black‑box constraints. It handles an arbitrary number of fidelity levels and non‑nested sampling, addressing gaps in existing methods. Experiments on standard benchmarks and challenging problems show that MF‑SCBO generally converges faster than both single‑fidelity SCBO and other multi‑fidelity approaches in high‑dimensional constrained settings.

By Lucas Palazzolo, Micka\"el Binois, La\"etitia Giraldi
arXiv Machine Learning
Jun 2

Local Preferential Bayesian Optimization

arXiv:2606. 02351v1 Announce Type: new Abstract: Bayesian optimization (BO) is a popular and effective approach for tuning expensive, noisy experiments, but requires the formulation of an explicit objective function.

By Johanna Menn, Miriam Kober, Paul Brunzema, David Stenger, Sebastian Trimpe
arXiv Machine Learning
Jun 8

LAGO: A Local-Global Optimization Framework Combining Trust Region Methods and Bayesian Optimization

arXiv:2603. 02970v2 Announce Type: replace Abstract: We introduce LAGO, a LocAl-Global Optimization framework coupling Bayesian Optimization (BO) and gradient-based trust region local refinement through an adaptive competition mechanism for smooth expensive-to-evaluate objective functions with available gradients.

By Eliott Van Dieren, Tommaso Vanzan, Fabio Nobile
arXiv Machine Learning
Aug 3

Frugal Bayesian Optimization: Scalable Surrogates for Data- and Resource-Limited Discovery

arXiv:2607. 29225v1 Announce Type: new Abstract: Bayesian Optimization (BO) is widely adopted for data-efficient optimization in scientific and engineering applications, yet its computational cost is rarely evaluated alongside optimization performance.

By Panagiotis Krokidas, Christoforos Rekatsinas, Vassilis Sioros, Grigorios M. Chatziathanasiou, Efi-Maria Papia, George Giannakopoulos
arXiv AI
Aug 6

Out-Of-The-Loop Multi-Fidelity Bayesian Optimization

arXiv:2608. 04113v1 Announce Type: cross Abstract: Black-box optimization is a ubiquitous problem in science and engineering, often dealing with expensive objective functions with cheaper lower-fidelity proxies available.

By Gustavo Sutter, Hao Wang, Luis Ricardez-Sandoval, Pascal Poupart, Agustinus Kristiadi
arXiv Machine Learning
Sep 4

No-Regret Bayesian Optimization with Finite-Library Input-Warped Kernels

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