arXiv Machine Learning

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.

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
arXiv Machine Learning
Aug 27

Gradient-based Sample Selection for Faster Bayesian Optimization

The paper introduces Gradient-based Sample Selection Bayesian Optimization (GSSBO), a method that builds the Gaussian process surrogate on a strategically chosen subset of samples rather than the full dataset. By using gradient information to eliminate redundant points while keeping diversity and representativeness, GSSBO achieves sublinear regret bounds and reduces the cubic computational cost of standard BO. Experiments on synthetic and real-world tasks show that this approach maintains comparable optimization performance while significantly cutting GP fitting time and resource usage.

By Qiyu Wei, Haowei Wang, Zirui Cao, Songhao Wang, Richard Allmendinger, Mauricio A \'Alvarez
arXiv AI
Aug 20

Automated Computational Energy Minimization of ML Algorithms using Constrained Bayesian Optimization

The paper presents a method that uses Constrained Bayesian Optimization (CBO) to minimize the energy consumption of machine learning models while ensuring their generalization performance stays above a specified threshold. By treating energy usage as the primary objective and performance as a constraint, the authors demonstrate that CBO can reduce training energy costs on both regression and classification tasks without sacrificing predictive accuracy.

By Pallavi Mitra, Felix Biessmann
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
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