Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition

• URL: http://arxiv.org/abs/2604.15959v1
• Date: Fri, 17 Apr 2026 11:24:56 GMT
• Title: Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition
• Abstract summary: We propose textitSTAGE-BO, Sequential Targeting Adaptive Gap-Filling $varepsilon$-Constraint Bayesian Optimization.<n>By analyzing the coverage of the approximate Pareto front, our method identifies the largest geometric gaps.<n>These gaps are then used as constraints, which transforms the problem into a sequence of inequality-constrained subproblems.
• Score: 19.76344805798142
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multi-objective Bayesian optimization (MOBO) provides a principled framework for optimizing expensive black-box functions with multiple objectives. However, existing MOBO methods often struggle with coverage, scalability with respect to the number of objectives, and integrating constraints and preferences. In this work, we propose \textit{STAGE-BO, Sequential Targeting Adaptive Gap-Filling $\varepsilon$-Constraint Bayesian Optimization}, that explicitly targets under-explored regions of the Pareto front. By analyzing the coverage of the approximate Pareto front, our method identifies the largest geometric gaps. These gaps are then used as constraints, which transforms the problem into a sequence of inequality-constrained subproblems, efficiently solved via constrained expected improvement acquisition. Our approach provides a uniform Pareto coverage without hypervolume computation and naturally applies to constrained and preference-based settings. Experiments on synthetic and real-world benchmarks demonstrate superior coverage and competitive hypervolume performance against state-of-the-art baselines.

Related papers

• Binary Optimization with Complex Constraints via Quantum Approximate Multi-Objective Optimization [1.3827807729367585]
  We show that a class of binary optimization problems with complex non-quadratic objectives or constraints can be reformulated as multi-objective quadratic unconstrained binary optimization problems.<n>We demonstrate the approach for binary portfolio optimization under a Conditional Value-at-Risk constraint.
  arXiv  Detail & Related papers  (2026-09-12T08:07:15Z)
• Multi-Objective Kinodynamic Motion Planning with Asymptotic Pareto Optimality [8.518351216651062]
  We address the challenge of multi-objective motion planning for systems under kinodynamic constraints.<n>We propose a unified algorithmic framework built upon the Stable Sparse-RRT (SST) algorithm.
  arXiv  Detail & Related papers  (2026-07-16T23:32:59Z)
• Multinoulli Extension: A Lossless Continuous Relaxation for Partition-Constrained Subset Selection [60.07018090570548]
  We introduce a novel algorithm titled MultinoulliSCG, which is parameterfree and can achieve the same approximation guarantees as the distorted local-search methods.<n>We also present two novel online algorithms, namely, Multinoulli-CG and Multinoulli-GAGA, for the unexplored online subset selection problems over partition constraints.
  arXiv  Detail & Related papers  (2026-03-23T02:30:01Z)
• BAMBO: Construct Ability and Efficiency LLM Pareto Set via Bayesian Adaptive Multi-objective Block-wise Optimization [4.196004665145396]
  BAMBO (Bayesian Adaptive Multi-objective Block-wise Optimization) is a novel framework that automatically constructs the Large Language Models (LLMs)<n>Formulated as a 1D clustering problem, this strategy leverages a dynamic programming approach to optimally balance intra-blockvolume and inter-block information distribution.
  arXiv  Detail & Related papers  (2025-12-10T15:32:56Z)
• OrthAlign: Orthogonal Subspace Decomposition for Non-Interfering Multi-Objective Alignment [61.02595549125661]
  Large language model (LLM) alignment faces a critical dilemma when addressing multiple human preferences.<n>We present OrthAlign, an innovative approach to resolve gradient-level conflicts in preference alignment.<n>We show that OrthAlign achieves maximum single-preference improvements ranging from 34.61% to 50.89% after multiple-objective alignment.
  arXiv  Detail & Related papers  (2025-09-29T11:16:30Z)
• SPREAD: Sampling-based Pareto front Refinement via Efficient Adaptive Diffusion [0.8594140167290097]
  SPREAD is a generative framework based on Denoising Diffusion Probabilistic Models (DDPMs)<n>It learns a conditional diffusion process over points sampled from the decision space.<n>It refines candidates via a sampling scheme that uses an adaptive multiple gradient descent-inspired update for fast convergence.
  arXiv  Detail & Related papers  (2025-09-25T12:09:37Z)
• Simple Optimizers for Convex Aligned Multi-Objective Optimization [19.421000251704168]
  We study gradient-descent algorithms for convex AMOO under standard smoothness or Lipschitz continuity conditions-assumptions.<n>We develop tools, propose scalable algorithms for convex AMOO, and establish their convergence guarantees.
  arXiv  Detail & Related papers  (2025-09-06T19:08:35Z)
• Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization [66.51747366239299]
  We propose a smooth variant of the min-max problem based on the augmented Lagrangian.<n>The proposed algorithm scales better with the number of objectives than subgradient-based strategies.
  arXiv  Detail & Related papers  (2025-03-16T11:05:51Z)
• Non-Myopic Multi-Objective Bayesian Optimization [64.31753000439514]
  We consider the problem of finite-horizon sequential experimental design to solve multi-objective optimization problems.<n>This problem arises in many real-world applications, including materials design.<n>We propose the first set of non-myopic methods for MOO problems.
  arXiv  Detail & Related papers  (2024-12-11T04:05:29Z)
• Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process [56.55075925645864]
  The problem of constrained decision process (CMDP) is investigated, where an agent aims to maximize the expected accumulated discounted reward subject to multiple constraints. A new utilities-dual convex approach is proposed with novel integration of three ingredients: regularized policy, dual regularizer, and Nesterov's gradient descent dual. This is the first demonstration that nonconcave CMDP problems can attain the lower bound of $mathcal O (1/epsilon)$ for all complexity optimization subject to convex constraints.
  arXiv  Detail & Related papers  (2021-10-20T02:57:21Z)
• A Hybrid 2-stage Neural Optimization for Pareto Front Extraction [3.918940900258555]
  A major obstacle to optimal trade-off solutions is that they don't always converge to each other. We propose a two-stage approach that is accurate and cost-effective.
  arXiv  Detail & Related papers  (2021-01-27T20:56:19Z)
• Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization [98.0595480384208]
  We propose a generalization extraient spaces which converges to a stationary point. The algorithm applies not only to general $p$-normed spaces, but also to general $p$-dimensional vector spaces.
  arXiv  Detail & Related papers  (2020-10-31T21:35:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.