Preprint · 2021 · Open access
Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement
arXiv (Cornell University), 34 · Published 17 May 2021 · DOI 10.48550/arxiv.2105.08195
In brief
“Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement” is a 2021 preprint by Samuel Daulton and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 277 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 277
- Most cited in
- 2026 (76)
- References
- 72
- Authors
- 3
Abstract
Optimizing multiple competing black-box objectives is a challenging problem in many fields, including science, engineering, and machine learning. Multi-objective Bayesian optimization (MOBO) is a sample-efficient approach for identifying the optimal trade-offs between the objectives. However, many existing methods perform poorly when the observations are corrupted by noise. We propose a novel acquisition function, NEHVI, that overcomes this important practical limitation by applying a Bayesian treatment to the popular expected hypervolume improvement (EHVI) criterion and integrating over this uncertainty in the Pareto frontier. We argue that, even in the noiseless setting, generating multiple candidates in parallel is an incarnation of EHVI with uncertainty in the Pareto frontier and therefore can be addressed using the same underlying technique. Through this lens, we derive a natural parallel variant, $q$NEHVI, that reduces computational complexity of parallel EHVI from exponential to polynomial with respect to the batch size. $q$NEHVI is one-step Bayes-optimal for hypervolume maximization in both noisy and noiseless environments, and we show that it can be optimized effectively with gradient-based methods via sample average approximation. Empirically, we demonstrate not only that $q$NEHVI is substantially more robust to observation noise than existing MOBO approaches, but also that it achieves state-of-the-art optimization performance and competitive wall-times in large-batch environments.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Daulton, S., Balandat, M., & Bakshy, E. (2021). Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement. arXiv (Cornell University), 34. https://doi.org/10.48550/arxiv.2105.08195
MLA 9
Daulton, Samuel, et al. “Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement.” arXiv (Cornell University), vol. 34, 2021. https://doi.org/10.48550/arxiv.2105.08195.
Chicago
Daulton, Samuel, Maximilian Balandat, and Eytan Bakshy. 2021. “Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement.” arXiv (Cornell University) 34. https://doi.org/10.48550/arxiv.2105.08195.
Harvard
Daulton, S., Balandat, M. and Bakshy, E. (2021) ‘Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement’, arXiv (Cornell University), 34. doi:10.48550/arxiv.2105.08195.
IEEE
S. Daulton, M. Balandat, and E. Bakshy, “Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement,” arXiv (Cornell University), vol. 34, 2021, doi: 10.48550/arxiv.2105.08195.
BibTeX
@misc{daulton2021parallel,
title = {{Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement}},
author = {Daulton, Samuel and Balandat, Maximilian and Bakshy, Eytan},
howpublished = {arXiv (Cornell University)},
year = {2021},
volume = {34},
doi = {10.48550/arxiv.2105.08195},
url = {https://doi.org/10.48550/arxiv.2105.08195}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2020 | 1 | |
| 2021 | 3 | |
| 2022 | 20 | |
| 2023 | 40 | |
| 2024 | 75 | |
| 2025 | 62 | |
| 2026 | 76 |
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- multi-objective Bayesian optimization
- expected hypervolume improvement
- acquisition functions
- parallel optimization
- black-box optimization
- sample average approximation
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., Balandat, M., & Bakshy, E. (2021). Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement. arXiv (Cornell University), 34. https://doi.org/10.48550/arxiv.2105.08195
How many times has this paper been cited?
277 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, Maximilian Balandat, Eytan Bakshy.
What is the DOI of this paper?
10.48550/arxiv.2105.08195, permanently at https://doi.org/10.48550/arxiv.2105.08195. 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.