Journal article · 2026 · Open access
Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation?
Transactions on machine learning research · Published 10 April 2026 · DOI 10.48550/arxiv.2604.09417
In brief
“Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation?” is a 2026 journal article by Chao Jiang and 2 co-authors, published in Transactions on machine learning research. OpenAlex counts 2 citations as of 19 November 2026, which puts it in the top 6% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at Transactions on machine learning research.
- Citations
- 2
- Most cited in
- 2026 (2)
- Field-weighted impact
- 3.28
- References
- 118
- Authors
- 3
Abstract
Many-objective optimisation, a subset of multi-objective optimisation, involves optimisation problems with more than three objectives. As the number of objectives increases, the number of solutions needed to adequately represent the entire Pareto front typically grows substantially. This makes it challenging, if not infeasible, to design a search algorithm capable of effectively exploring the entire Pareto front. This difficulty is particularly acute in the Bayesian optimisation paradigm, where sample efficiency is critical and only a limited number of solutions (often a few hundred) are evaluated. Moreover, after the optimisation process, the decision-maker eventually selects just one solution for deployment, regardless of how many high-quality, diverse solutions are available. In light of this, we argue an idea that under a very limited evaluation budget, it may be more useful to focus on finding a single solution of the highest possible quality for the decision-maker, rather than aiming to approximate the entire Pareto front as existing many-/multi-objective Bayesian optimisation methods typically do. Bearing this idea in mind, this paper proposes a \underline{s}ingle \underline{p}oint-based \underline{m}ulti-\underline{o}bjective search framework (SPMO) that aims to improve the quality of solutions along a direction that leads to a good tradeoff between objectives. Within SPMO, we present a simple acquisition function, called expected single-point improvement (ESPI), working under both noiseless and noisy scenarios. We show that ESPI can be optimised effectively with gradient-based methods via the sample average approximation (SAA) approach and theoretically prove its convergence guarantees under the SAA. We also empirically demonstrate that the proposed SPMO is computationally tractable and outperforms state-of-the-arts on a wide range of benchmark and real-world problems.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Jiang, C., Huang, J., & Li, M. (2026). Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation? Transactions on machine learning research. https://doi.org/10.48550/arxiv.2604.09417
MLA 9
Jiang, Chao, et al. “Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation?” Transactions on machine learning research, 2026. https://doi.org/10.48550/arxiv.2604.09417.
Chicago
Jiang, Chao, Jingyu Huang, and Miqing Li. 2026. “Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation?” Transactions on machine learning research. https://doi.org/10.48550/arxiv.2604.09417.
Harvard
Jiang, C., Huang, J. and Li, M. (2026) ‘Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation?’, Transactions on machine learning research. doi:10.48550/arxiv.2604.09417.
IEEE
C. Jiang, J. Huang, and M. Li, “Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation?,” Transactions on machine learning research, 2026, doi: 10.48550/arxiv.2604.09417.
BibTeX
@article{jiang2026really,
title = {{Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation?}},
author = {Jiang, Chao and Huang, Jingyu and Li, Miqing},
journal = {Transactions on machine learning research},
year = {2026},
doi = {10.48550/arxiv.2604.09417},
url = {https://doi.org/10.48550/arxiv.2604.09417}
}
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
- Pareto front
- acquisition functions
- sample average approximation
- convergence guarantees
- sample efficiency
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Jiang, C., Huang, J., & Li, M. (2026). Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation? Transactions on machine learning research. https://doi.org/10.48550/arxiv.2604.09417
How many times has this paper been cited?
2 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 Transactions on machine learning research: sign in and open the full text from this page.
Who wrote this paper?
Chao Jiang, Jingyu Huang, Miqing Li.
What is the DOI of this paper?
10.48550/arxiv.2604.09417, permanently at https://doi.org/10.48550/arxiv.2604.09417. 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.