Preprint · 2021 · Open access
Multi-Objective Bayesian Optimization over High-Dimensional Search Spaces
arXiv (Cornell University) · Published 22 September 2021 · DOI 10.48550/arxiv.2109.10964
In brief
“Multi-Objective Bayesian Optimization over High-Dimensional Search Spaces” is a 2021 preprint by Samuel Daulton and 3 co-authors, published in arXiv (Cornell University). OpenAlex counts 120 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 120
- Most cited in
- 2025 (34)
- References
- 64
- Authors
- 4
Abstract
Many real world scientific and industrial applications require optimizing multiple competing black-box objectives. When the objectives are expensive-to-evaluate, multi-objective Bayesian optimization (BO) is a popular approach because of its high sample efficiency. However, even with recent methodological advances, most existing multi-objective BO methods perform poorly on search spaces with more than a few dozen parameters and rely on global surrogate models that scale cubically with the number of observations. In this work we propose MORBO, a scalable method for multi-objective BO over high-dimensional search spaces. MORBO identifies diverse globally optimal solutions by performing BO in multiple local regions of the design space in parallel using a coordinated strategy. We show that MORBO significantly advances the state-of-the-art in sample efficiency for several high-dimensional synthetic problems and real world applications, including an optical display design problem and a vehicle design problem with 146 and 222 parameters, respectively. On these problems, where existing BO algorithms fail to scale and perform well, MORBO provides practitioners with order-of-magnitude improvements in sample efficiency over the current approach.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Daulton, S., Eriksson, D., Balandat, M., & Bakshy, E. (2021). Multi-Objective Bayesian Optimization over High-Dimensional Search Spaces. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2109.10964
MLA 9
Daulton, Samuel, et al. “Multi-Objective Bayesian Optimization over High-Dimensional Search Spaces.” arXiv (Cornell University), 2021. https://doi.org/10.48550/arxiv.2109.10964.
Chicago
Daulton, Samuel, David Eriksson, Maximilian Balandat, and Eytan Bakshy. 2021. “Multi-Objective Bayesian Optimization over High-Dimensional Search Spaces.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2109.10964.
Harvard
Daulton, S. et al. (2021) ‘Multi-Objective Bayesian Optimization over High-Dimensional Search Spaces’, arXiv (Cornell University). doi:10.48550/arxiv.2109.10964.
IEEE
S. Daulton, D. Eriksson, M. Balandat, and E. Bakshy, “Multi-Objective Bayesian Optimization over High-Dimensional Search Spaces,” arXiv (Cornell University), 2021, doi: 10.48550/arxiv.2109.10964.
BibTeX
@misc{daulton2021multi,
title = {{Multi-Objective Bayesian Optimization over High-Dimensional Search Spaces}},
author = {Daulton, Samuel and Eriksson, David and Balandat, Maximilian and Bakshy, Eytan},
howpublished = {arXiv (Cornell University)},
year = {2021},
doi = {10.48550/arxiv.2109.10964},
url = {https://doi.org/10.48550/arxiv.2109.10964}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2021 | 1 | |
| 2022 | 16 | |
| 2023 | 22 | |
| 2024 | 23 | |
| 2025 | 34 | |
| 2026 | 24 |
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- multi-objective Bayesian optimization
- high-dimensional search spaces
- sample efficiency
- expensive black-box functions
- scalable optimization
- vehicle design
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?
Daulton, S., Eriksson, D., Balandat, M., & Bakshy, E. (2021). Multi-Objective Bayesian Optimization over High-Dimensional Search Spaces. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2109.10964
How many times has this paper been cited?
120 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?
Samuel Daulton, David Eriksson, Maximilian Balandat, Eytan Bakshy.
What is the DOI of this paper?
10.48550/arxiv.2109.10964, permanently at https://doi.org/10.48550/arxiv.2109.10964. 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.