Preprint · 2022 · Open access
Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization
arXiv (Cornell University) · Published 10 May 2022 · DOI 10.48550/arxiv.2205.04901
In brief
“Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization” is a 2022 preprint by Shouri Hu and 4 co-authors, published in arXiv (Cornell University). OpenAlex counts 6 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 6
- Most cited in
- 2025 (3)
- References
- 57
- Authors
- 5
Abstract
The expected improvement (EI) is one of the most popular acquisition functions for Bayesian optimization (BO) and has demonstrated good empirical performances in many applications for the minimization of simple regret. However, under the evaluation metric of cumulative regret, the performance of EI may not be competitive, and its existing theoretical regret upper bound still has room for improvement. To adapt the EI for better performance under cumulative regret, we introduce a novel quantity called the evaluation cost which is compared against the acquisition function, and with this, develop the expected improvement-cost (EIC) algorithm. In each iteration of EIC, a new point with the largest acquisition function value is sampled, only if that value exceeds its evaluation cost. If none meets this criteria, the current best point is resampled. This evaluation cost quantifies the potential downside of sampling a point, which is important under the cumulative regret metric as the objective function value in every iteration affects the performance measure. We establish in theory a high-probability regret upper bound of EIC based on the maximum information gain, which is tighter than the bound of existing EI-based algorithms. It is also comparable to the regret bound of other popular BO algorithms such as Thompson sampling (GP-TS) and upper confidence bound (GP-UCB). We further perform experiments to illustrate the improvement of EIC over several popular BO algorithms.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Hu, S., Wang, H., Dai, Z., Low, B. K. H., & Ng, S. H. (2022). Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2205.04901
MLA 9
Hu, Shouri, et al. “Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization.” arXiv (Cornell University), 2022. https://doi.org/10.48550/arxiv.2205.04901.
Chicago
Hu, Shouri, Haowei Wang, Zhongxiang Dai, Bryan Kian Hsiang Low, and Szu Hui Ng. 2022. “Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2205.04901.
Harvard
Hu, S. et al. (2022) ‘Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.2205.04901.
IEEE
S. Hu, H. Wang, Z. Dai, B. K. H. Low, and S. H. Ng, “Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization,” arXiv (Cornell University), 2022, doi: 10.48550/arxiv.2205.04901.
BibTeX
@misc{hu2022adjusted,
title = {{Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization}},
author = {Hu, Shouri and Wang, Haowei and Dai, Zhongxiang and Low, Bryan Kian Hsiang and Ng, Szu Hui},
howpublished = {arXiv (Cornell University)},
year = {2022},
doi = {10.48550/arxiv.2205.04901},
url = {https://doi.org/10.48550/arxiv.2205.04901}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2023 | 1 | |
| 2025 | 3 | |
| 2026 | 2 |
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- expected improvement
- cumulative regret
- Bayesian optimization
- acquisition functions
- evaluation costs
- regret upper bounds
- noisy optimization
- Thompson sampling
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Hu, S., Wang, H., Dai, Z., Low, B. K. H., & Ng, S. H. (2022). Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2205.04901
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?
Shouri Hu, Haowei Wang, Zhongxiang Dai, Bryan Kian Hsiang Low, Szu Hui Ng.
What is the DOI of this paper?
10.48550/arxiv.2205.04901, permanently at https://doi.org/10.48550/arxiv.2205.04901. 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.