Skip to content

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

Sep 2026 · 0 citations · 29 references
Computer Science Mathematics

TL;DR

A framework that extends standard single-objective acquisition functions directly to the multi-objective setting through a hypervolume-based transformation and extends hedge strategies for acquisition functions, which are typically used only in single-objective optimization, to the multi-objective regime is proposed.

Abstract

Multi-objective Bayesian optimization (MOBO) is commonly approached through specialized acquisition functions or scalarization schemes designed to explicitly account for trade-offs among non-preferential objectives. In this work, we show that such complexity might be unnecessary. We propose a framework that extends standard single-objective acquisition functions directly to the multi-objective setting through a hypervolume-based transformation. We further extend hedge strategies for acquisition functions, which are typically used only in single-objective optimization, to the multi-objective regime. Our approach requires minimal modification to existing Bayesian optimization pipelines and avoids the need for bespoke multi-objective formulations. We demonstrate how a broad class of commonly used single-objective acquisition functions and hedge strategies can be adapted in a principled manner to handle multiple objectives, while preserving their intuitive interpretation and computational efficiency. Empirically, we evaluate the proposed methods across a range of synthetic and real-world multi-objective benchmarks. Despite their simplicity, our extensions consistently match or outperform more complex state-of-the-art MOBO methods in terms of optimization performance and sample efficiency. These results suggest that effective multi-objective Bayesian optimization can be achieved by reusing and carefully extending well-established single-objective acquisition strategies, offering a simpler and more flexible alternative to existing approaches.

View source

Similar papers

#machine learning Preprint Sep 2026

Learning What to Evaluate: Correlation-Aware Decoupling for Multiobjective Bayesian Optimization

This work presents a new approach that leverages a multitask GP model to jointly learn all objectives and constraints, and proposes a total correlation metric that enables identifying an ${optimal}$ subset of objectives and constraints to be evaluated at every round, even under uniform evaluation costs.

Ashwin Renganathan, Peter Bachman · 0 citations
#machine learning Preprint Aug 2026

Enhancing Bayesian Optimization and Active Learning Through Kernel Diversity

A unified framework, KENDO (Kernel ENsemble Disagreement-aware Operator), is proposed that integrates Ensemble Gaussian Processes (EGP) with disagreement-aware acquisition strategies and extends the approach to multi-objective optimization via random scalarization that preserves the single-optimizer conditioning struct...

Heng Zhang, Hao-Tian Xiang, Konstantinos D. Polyzos et al. · 1 citation
Open access Sep 2026

Enhancing boundary optimality in constrained Bayesian optimization via exterior barrier functions

In Bayesian optimization frameworks, expected performance indicator-based acquisition functions, such as Expected Improvement and Expected Hypervolume Improvement, are among the most widely adopted approaches for both single- and multi-objective problems, and are readily extensible to constrained problems through sur...

S. Lim, P. Bekemeyer · 0 citations
#machine learning Preprint Oct 2026

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

Bayesian optimization often involves multiple objectives, constraints, and fidelity levels. We address the challenge of jointly selecting where and at which fidelity to evaluate to identify the highest-fidelity feasible Pareto frontier in this combined setting. From a unified information-theoretic perspective, we measu...

Rikuto Matsumoto, Masanori Ishikura, Masayuki Karasuyama · 0 citations
Preprint Aug 2026

Parallelizable Gradient-Based Optimization For Multi-Objective MaxCut

This paper develops a differentiable framework for multi-objective MaxCut by combining an adjacency-based quadratic formulation with linear scalarization, thereby reducing the problem to a preference-conditioned single-objective signed-weight MaxCut problem.

Jing-Hang Huang, Cheng-Han Huang, Alvaro Velasquez et al. · 0 citations
Preprint Aug 2026

BOCoDe: Engineering-Centered Benchmarking for Bayesian Optimization

BOCoDe is introduced, an open-source, PyTorch-native benchmark comprising 307 BBO problems, including 159 engineering design tasks and widely used synthetic and HPO benchmarks that establish a reproducible and extensible foundation for developing and evaluating BO methods that better reflect the demands of engineering...

Rosen Yu, Christophe Hatterer, A. Narayanan et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.