mlsanityData to 7 Oct 2026

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

arXiv 2609.32632 ↗First posted 26 Sep 2026stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Multiobjective Bayesian optimization (MOBO) with Gaussian process (GP) surrogates is a sample efficient approach to solving multiobjective optimization problems. In MOBO, a Bayesian decision theoretic acquisition function guides the adaptive selection of new candidate inputs, on which objectives and constraints are evaluated to update the surrogate model sequentially. Existing approaches maintain independent GP models for the objectives and constraints, with new observations evaluating all objectives and constraints in a coupled fashion. However, the objectives and constraints often contain inherent correlations which, if exploited, can enable decoupled evaluations where only a subset of them are evaluated at each round. We present a new approach that leverages a multitask GP model to jointly learn all objectives and constraints, and propose 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. Theoretically, we show that our acquisition policy is asymptotically consistent despite decoupling and that our proposed decoupled subset selection rule maximizes the expected posterior entropy reduction about unevaluated tasks under mild conditions. Empirically, we show that our approach outperforms coupled and decoupled baselines in the state of the art.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 44 references that are in the map. First posted on arXiv 26 Sep 2026.

Builds on

16 of 44 references.

References · 16

  1. 2018A Tutorial on Bayesian Optimizationcited by 734
  2. 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 603
  3. 2020Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimizationcited by 176
  4. 2023Unexpected Improvements to Expected Improvement for Bayesian Optimizationcited by 144
  5. 2020Max-value Entropy Search for Multi-Objective Bayesian Optimization with Constraintscited by 81
  6. 2020An Easy-to-use Real-world Multi-objective Optimization Problem Suitecited by 71
  7. 2019Multi-objective Bayesian Optimization using Pareto-frontier Entropycited by 57
  8. 2022Joint Entropy Search for Multi-objective Bayesian Optimizationcited by 45
  9. 2016Predictive Entropy Search for Multi-objective Bayesian Optimization with Constraintscited by 27
  10. 2019Efficient Computation of Expected Hypervolume Improvement Using Box Decomposition Algorithmscited by 24
  11. 2020MLPerf Mobile Inference Benchmarkcited by 14
  12. 2020Parallel Predictive Entropy Search for Multi-objective Bayesian Optimization with Constraintscited by 12
4 more
  1. 2023qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson samplingcited by 11
  2. 2023Knowledge Gradient for Multi-Objective Bayesian Optimization with Decoupled Evaluationscited by 5
  3. 2025Multiobjective Aerodynamic Design Optimization of the NASA Common Research Modelcited by 3
  4. 2020FlexiBO: A Decoupled Cost-Aware Multi-Objective Optimization Approach for Deep Neural Networkscited by 2

Built on by

Not cited yet.