Preprint · 2026 · Open access
Converge Then Diversify: Decoupling Convergence and Diversity in Multi-Objective Bayesian Optimisation
arXiv (Cornell University) · Published 11 September 2026
In brief
“Converge Then Diversify: Decoupling Convergence and Diversity in Multi-Objective Bayesian Optimisation” is a 2026 preprint by Chao Jiang and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 0 citations as of 18 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 0
- References
- 133
- Authors
- 3
Abstract
Multi-objective Bayesian optimisation (MOBO) is a sample-efficient approach for optimising expensive black-box functions with multiple objectives. In MOBO, the goal is to adequately approximate the Pareto front; that is, to obtain a high-quality solution set with 1) good convergence (closeness to the Pareto front) and 2) good diversity (spread across the Pareto front). Existing MOBO methods typically aim to accomplish these two tasks simultaneously, i.e., driving the search towards the Pareto front while maintaining a diverse set of nondominated solutions, such that the solutions, ideally, can gradually approach the entire front. When sufficient search budgets are available, this approach is effective. However, considering both convergence and diversity throughout the search is not easy and requires careful design. Under very tight budgets, there may not be enough solutions generated to be able to simultaneously approach the entire Pareto front. To address this issue, this paper proposes a \textit{converge-then-diversify} (CTD) approach that decouples convergence and diversity into two stages. In the first stage, CTD focuses on convergence, aiming to quickly drive the search toward a single point on the Pareto front. In the second stage, CTD focuses on diversity, aiming to spread solutions across the front. We present two simple instantiations of CTD by using widely adopted acquisition functions in the area. Experimental results show that, across all 446 pairwise comparisons, CTD statistically outperforms state-of-the-art methods in 72.9\% of the cases, performs equivalently in 21.1\%, and is statistically worse in only 6.1\%, with the advantage being particularly evident in settings with very tight evaluation budgets or in high-dimensional 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, Y., & Li, M. (2026). Converge Then Diversify: Decoupling Convergence and Diversity in Multi-Objective Bayesian Optimisation. arXiv (Cornell University). https://arxiv.org/abs/2609.13396
MLA 9
Jiang, Chao, et al. “Converge Then Diversify: Decoupling Convergence and Diversity in Multi-Objective Bayesian Optimisation.” arXiv (Cornell University), 2026. https://arxiv.org/abs/2609.13396.
Chicago
Jiang, Chao, Yueling Huang, and Miqing Li. 2026. “Converge Then Diversify: Decoupling Convergence and Diversity in Multi-Objective Bayesian Optimisation.” arXiv (Cornell University). https://arxiv.org/abs/2609.13396.
Harvard
Jiang, C., Huang, Y. and Li, M. (2026) ‘Converge Then Diversify: Decoupling Convergence and Diversity in Multi-Objective Bayesian Optimisation’, arXiv (Cornell University). Available at: https://arxiv.org/abs/2609.13396.
IEEE
C. Jiang, Y. Huang, and M. Li, “Converge Then Diversify: Decoupling Convergence and Diversity in Multi-Objective Bayesian Optimisation,” arXiv (Cornell University), 2026.
BibTeX
@misc{jiang2026converge,
title = {{Converge Then Diversify: Decoupling Convergence and Diversity in Multi-Objective Bayesian Optimisation}},
author = {Jiang, Chao and Huang, Yueling and Li, Miqing},
howpublished = {arXiv (Cornell University)},
year = {2026},
url = {https://arxiv.org/abs/2609.13396}
}
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 approximation
- acquisition functions
- black-box optimization
- high-dimensional problems
- Pareto optimal solutions
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, Y., & Li, M. (2026). Converge Then Diversify: Decoupling Convergence and Diversity in Multi-Objective Bayesian Optimisation. arXiv (Cornell University). https://arxiv.org/abs/2609.13396
How many times has this paper been cited?
0 times, according to OpenAlex on 18 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?
Chao Jiang, Yueling Huang, Miqing Li.
Bibliographic data from OpenAlex (CC0), last checked 18 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.