arXiv Machine Learning

Exploiting Separability in Multi-Scale Grey-Box Bayesian Optimization

arXiv:2608. 03045v1 Announce Type: new Abstract: We consider grey-box optimization problems where the decision variables naturally partition into black-box variables (as arguments to an expensive black-box function) and white-box variables, governed by a set of explicit, closed-form equations that also depend on the output of the black-box function.

arXiv Machine Learning
Jul 16

Maximally Robust Satisficing Bayesian Optimization

arXiv:2607. 13652v1 Announce Type: new Abstract: Many design tasks can be cast as black-box function optimization, enabling use of Bayesian optimization to find an ideal design with minimal number of trials.

By Samuli Kinnunen, Petrus Mikkola, Antti Niskanen, Arto Klami
arXiv Machine Learning
Jul 14

Modernizing HEBO: a robust Bayesian optimization baseline for practical heteroskedastic and non-stationary problems

arXiv:2607. 10669v1 Announce Type: new Abstract: Bayesian optimization is increasingly used to guide data-efficient experimentation in chemistry, materials science, and related laboratory settings, but its practical performance depends strongly on how well surrogate-model assumptions match the geometry and noise structure of the underlying objective.

By L. A. Zhukov, E. V. Shaburova, D. V. Antonets
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 Machine Learning
Jun 9

Improving Bayesian Optimization via Training-Aware Conditional Diffusion Models

arXiv:2606. 08438v1 Announce Type: cross Abstract: Bayesian optimization (BO) is a widely used approach for black-box optimization that uses a Gaussian process (GP) as a surrogate and guides sequential evaluations via an acquisition function, with the ultimate goal of locating the global optimum $\mathbf{x}^{\star}$.

By Yilin Zheng, Haowei Wang, Szu Hui Ng, Enlu Zhou