arXiv Statistics ML

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.

arXiv Machine Learning
6d ago

Investigating Composite Modeling in Multi-Objective Bayesian Optimization for Scientific Design

The paper investigates how incorporating intermediate responses—known as Composite modeling—into Multi‑Objective Bayesian Optimization (MOBO) can improve sampling efficiency for scientific design problems. It establishes theoretical conditions under which intermediate observations add no predictive value and then conducts controlled experiments across four MOBO methods and eight benchmarks to assess practical gains. Results indicate that Composite modeling is most beneficial when the mapping from intermediate responses to final objectives is non‑bijective and non‑affine.

By Ricky Ye, Sahas Goli, Muhammad Ali, Poompol Buathong, Peter I. Frazier
arXiv AI
3d ago

FoMEMO: Towards Foundation Models for Expensive Multi-objective Optimization

FoMEMO is a foundation model designed for expensive multi-objective optimization. It transforms the problem into preference-wise aggregated posterior learning tasks, allowing scalable pre-training on vast synthetic datasets without extensive real-world experiments. At inference, the model uses observed trajectories and user preferences to perform in-context posterior prediction and optimize acquisition functions, achieving strong generalization without further training.

By Yiming Yao, Fei Liu, Liang Zhao, Xi Lin, Yilu Liu, Qingfu Zhang
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 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 AI
Oct 28

BoLT: A Benchmark to Democratize Black-box Optimization Research for Expensive LLM Tasks

BoLT is a new benchmark designed to make black-box optimization research for large language model (LLM) tasks more accessible. It presents a suite of realistic LLM optimization problems—covering multi‑fidelity, multi‑objective, heteroscedastic noise, and high‑dimensional search spaces—grounded in thousands of real experiments and represented by lightweight surrogate models. The authors evaluate a wide range of Bayesian and other black‑box optimization methods on BoLT, finding that some BO techniques consistently outperform others and revealing gaps in current methods for LLM optimization.

By Ruth Wan Theng Chew, Zhiliang Chen, Apivich Hemachandra, Bryan Kian Hsiang Low
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