Preprint · 2026 · Open access

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

Yaohong Yang, Sammie Katt, Samuel Kaski

arXiv (Cornell University) · Published 17 April 2026 · DOI 10.48550/arxiv.2604.15959

Open PDFView at the publisherCite this paper

In brief

“Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition” is a 2026 preprint by Yaohong Yang and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 1 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).

Citations
1
Most cited in
2026 (1)
References
45
Authors
3

Abstract

Multi-objective Bayesian optimization (MOBO) provides a principled framework for optimizing multiple expensive black-box functions. However, existing MOBO methods often struggle with coverage, scalability, and handling constraints and preferences. In this work we propose STAGE-BO, Sequential Targeting Adaptive Gap-Filling $\varepsilon$-Constraint Bayesian Optimization: by analyzing the coverage of the surrogate Pareto front, our method identifies the Pareto front point with the largest uncovered gap, and uses its coordinates to define adaptive constraints in $\varepsilon$-constraint method, which transforms the problem into a sequence of inequality-constrained subproblems, efficiently solved via constrained expected improvement acquisition. Our approach provides uniform Pareto coverage without hypervolume computation and naturally handles constraints and preferences. Experiments on synthetic and real-world benchmarks demonstrate superior coverage and competitive hypervolume performance against state-of-the-art baselines. Our code implementation can be found at https://github.com/YangYaohong1/STAGE-BO.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Yang, Y., Katt, S., & Kaski, S. (2026). Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2604.15959

MLA 9

Yang, Yaohong, et al. “Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition.” arXiv (Cornell University), 2026. https://doi.org/10.48550/arxiv.2604.15959.

Chicago

Yang, Yaohong, Sammie Katt, and Samuel Kaski. 2026. “Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2604.15959.

Harvard

Yang, Y., Katt, S. and Kaski, S. (2026) ‘Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition’, arXiv (Cornell University). doi:10.48550/arxiv.2604.15959.

IEEE

Y. Yang, S. Katt, and S. Kaski, “Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition,” arXiv (Cornell University), 2026, doi: 10.48550/arxiv.2604.15959.

BibTeX

@misc{yang2026multi,
  title     = {{Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition}},
  author    = {Yang, Yaohong and Katt, Sammie and Kaski, Samuel},
  howpublished = {arXiv (Cornell University)},
  year      = {2026},
  doi       = {10.48550/arxiv.2604.15959},
  url       = {https://doi.org/10.48550/arxiv.2604.15959}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • multi-objective Bayesian optimization
  • epsilon-constraint method
  • adaptive constraints
  • Pareto front coverage
  • surrogate models
  • hypervolume
  • black-box optimization

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Yang, Y., Katt, S., & Kaski, S. (2026). Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2604.15959

How many times has this paper been cited?

1 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Yaohong Yang, Sammie Katt, Samuel Kaski.

What is the DOI of this paper?

10.48550/arxiv.2604.15959, permanently at https://doi.org/10.48550/arxiv.2604.15959. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.