Conference paper · 2025 · Open access
MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions
neural information processing systems, 19518–19553 · Published 1 January 2025 · DOI 10.52202/085713-0581
In brief
“MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions” is a 2025 conference paper by Lam Ngo and 3 co-authors, published in neural information processing systems. OpenAlex counts 6 citations as of 19 November 2026, which puts it in the top 3% of works published in 2025 by citations. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 6
- Most cited in
- 2026 (6)
- Field-weighted impact
- 2.69
- References
- 47
- Authors
- 4
Abstract
Bayesian Optimization (BO) is a powerful tool for optimizing expensive black-box objective functions. While extensive research has been conducted on the single-objective optimization problem, the multi-objective optimization problem remains challenging. In this paper, we propose MOBO-OSD, a multi-objective Bayesian Optimization algorithm designed to generate a diverse set of Pareto optimal solutions by solving multiple constrained optimization problems, referred to as MOBO-OSD subproblems, along orthogonal search directions (OSDs) defined with respect to an approximated convex hull of individual objective minima. By employing a well-distributed set of OSDs, MOBO-OSD ensures broad coverage of the objective space, enhancing both solution diversity and hypervolume performance. To further improve the density of the set of Pareto optimal candidate solutions without requiring an excessive number of subproblems, we leverage a Pareto Front Estimation technique to generate additional solutions in the neighborhood of existing solutions. Additionally, MOBO-OSD supports batch optimization, enabling parallel function evaluations to accelerate the optimization process when resources are available. Through extensive experiments and analysis on a variety of synthetic and real-world benchmark functions with two to six objectives, we demonstrate that MOBO-OSD consistently outperforms the state-of-the-art algorithms. Our code implementation can be found at https://github.com/LamNgo1/mobo-osd.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Ngo, L., Ha, H., Chan, J., & Zhang, H. (2025). MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions. neural information processing systems, 19518–19553. https://doi.org/10.52202/085713-0581
MLA 9
Ngo, Lam, et al. “MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions.” neural information processing systems, 2025, pp. 19518–19553. https://doi.org/10.52202/085713-0581.
Chicago
Ngo, Lam, Huong Ha, Jeffrey Chan, and Hongyu Zhang. 2025. “MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions.” neural information processing systems: 19518–19553. https://doi.org/10.52202/085713-0581.
Harvard
Ngo, L. et al. (2025) ‘MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions’, neural information processing systems, pp. 19518–19553. doi:10.52202/085713-0581.
IEEE
L. Ngo, H. Ha, J. Chan, and H. Zhang, “MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions,” neural information processing systems, pp. 19518–19553, 2025, doi: 10.52202/085713-0581.
BibTeX
@inproceedings{ngo2025mobo,
title = {{MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions}},
author = {Ngo, Lam and Ha, Huong and Chan, Jeffrey and Zhang, Hongyu},
booktitle = {neural information processing systems},
year = {2025},
pages = {19518--19553},
doi = {10.52202/085713-0581},
url = {https://doi.org/10.52202/085713-0581}
}
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
- batch optimization
- Pareto optimal solutions
- solution diversity
- hypervolume
- expensive black-box functions
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?
Ngo, L., Ha, H., Chan, J., & Zhang, H. (2025). MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions. neural information processing systems, 19518–19553. https://doi.org/10.52202/085713-0581
How many times has this paper been cited?
6 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?
Lam Ngo, Huong Ha, Jeffrey Chan, Hongyu Zhang.
What is the DOI of this paper?
10.52202/085713-0581, permanently at https://doi.org/10.52202/085713-0581. 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.