Preprint · 2020 · Open access
Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization
arXiv (Cornell University), 33, 9851–9864 · Published 9 June 2020 · DOI 10.48550/arxiv.2006.05078
In brief
“Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization” is a 2020 preprint by Samuel Daulton and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 526 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 526
- Most cited in
- 2026 (168)
- References
- 72
- Authors
- 3
Abstract
In many real-world scenarios, decision makers seek to efficiently optimize multiple competing objectives in a sample-efficient fashion. Multi-objective Bayesian optimization (BO) is a common approach, but many of the best-performing acquisition functions do not have known analytic gradients and suffer from high computational overhead. We leverage recent advances in programming models and hardware acceleration for multi-objective BO using Expected Hypervolume Improvement (EHVI)---an algorithm notorious for its high computational complexity. We derive a novel formulation of q-Expected Hypervolume Improvement (qEHVI), an acquisition function that extends EHVI to the parallel, constrained evaluation setting. qEHVI is an exact computation of the joint EHVI of q new candidate points (up to Monte-Carlo (MC) integration error). Whereas previous EHVI formulations rely on gradient-free acquisition optimization or approximated gradients, we compute exact gradients of the MC estimator via auto-differentiation, thereby enabling efficient and effective optimization using first-order and quasi-second-order methods. Our empirical evaluation demonstrates that qEHVI is computationally tractable in many practical scenarios and outperforms state-of-the-art multi-objective BO algorithms at a fraction of their wall time.
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. (2020). Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization. arXiv (Cornell University), 33, 9851–9864. https://doi.org/10.48550/arxiv.2006.05078
MLA 9
Daulton, Samuel, et al. “Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization.” arXiv (Cornell University), vol. 33, 2020, pp. 9851–9864. https://doi.org/10.48550/arxiv.2006.05078.
Chicago
Daulton, Samuel, Maximilian Balandat, and Eytan Bakshy. 2020. “Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization.” arXiv (Cornell University) 33: 9851–9864. https://doi.org/10.48550/arxiv.2006.05078.
Harvard
Daulton, S., Balandat, M. and Bakshy, E. (2020) ‘Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization’, arXiv (Cornell University), 33, pp. 9851–9864. doi:10.48550/arxiv.2006.05078.
IEEE
S. Daulton, M. Balandat, and E. Bakshy, “Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization,” arXiv (Cornell University), vol. 33, pp. 9851–9864, 2020, doi: 10.48550/arxiv.2006.05078.
BibTeX
@misc{daulton2020differentiable,
title = {{Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization}},
author = {Daulton, Samuel and Balandat, Maximilian and Bakshy, Eytan},
howpublished = {arXiv (Cornell University)},
year = {2020},
volume = {33},
pages = {9851--9864},
doi = {10.48550/arxiv.2006.05078},
url = {https://doi.org/10.48550/arxiv.2006.05078}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2019 | 1 | |
| 2020 | 3 | |
| 2021 | 31 | |
| 2022 | 53 | |
| 2023 | 68 | |
| 2024 | 90 | |
| 2025 | 112 | |
| 2026 | 168 |
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
- auto-differentiation
- parallel evaluation
- constrained optimization
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. (2020). Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization. arXiv (Cornell University), 33, 9851–9864. https://doi.org/10.48550/arxiv.2006.05078
How many times has this paper been cited?
526 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.2006.05078, permanently at https://doi.org/10.48550/arxiv.2006.05078. 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.