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

MF-SCBO : Multi-fidelity Scalable Constrained Bayesian Optimization

Read the original on arXiv Machine Learning →

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.

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
Jul 7

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.

By Jing Jingzhe, Fan Zheyi, Szu Hui Ng, Qingpei Hu
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 Statistics ML
Nov 9

Simple Extensions of Single-Objective Acquisition Functions and Hedge Strategies for Multi-Objective Bayesian Optimization

The paper proposes a simple framework that extends standard single-objective Bayesian optimization acquisition functions to the multi-objective setting using a hypervolume-based approach, and adapts hedge strategies for multi-objective use. This method requires minimal changes to existing pipelines and preserves the intuitive interpretation and computational efficiency of the original strategies. Experiments on synthetic and real-world benchmarks show that these extensions consistently match or outperform more complex state-of-the-art multi-objective Bayesian optimization methods.

By Haris Moazam Sheikh
arXiv Machine Learning
Oct 8

A Unified Information-Theoretic Approach to Constrained Multi-Fidelity Multi-Objective Bayesian Optimization

The paper introduces a unified information‑theoretic framework for Bayesian optimization that simultaneously handles multiple objectives, constraints, and fidelity levels. It defines query utility as the information gain about the highest‑fidelity feasible Pareto frontier and derives a tractable variational lower bound using truncated approximations. The resulting cost‑aware acquisition function leverages multi‑fidelity surrogate models, eliminating the need for separate heuristics, and is validated on synthetic, benchmark, and real‑world experiments.

By Rikuto Matsumoto, Masanori Ishikura, Masayuki Karasuyama