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

Maximally Robust Satisficing Bayesian Optimization

Read the original on arXiv Machine Learning →

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.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

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 5

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.

By Joshua E. Hammond, Tyler A. Soderstrom, Brian A. Korgel, Michael Baldea