arXiv Machine Learning By Jing Jingzhe, Fan Zheyi, Szu Hui Ng, Qingpei Hu

Local Constrained Bayesian Optimization

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

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