A Corrected Expected Improvement Acquisition Function Under Noisy Observations
Not on the map. Why?
Abstract (arXiv)
Sequential maximization of expected improvement (EI) is one of the most widely used policies in Bayesian optimization because of its simplicity and ability to handle noisy observations. In particular, the improvement function often uses the best posterior mean as the best incumbent in noisy settings. However, the uncertainty associated with the incumbent solution is often neglected in many analytic EI-type methods: a closed-form acquisition function is derived in the noise-free setting, but then applied to the setting with noisy observations. To address this limitation, we propose a modification of EI that corrects its closed-form expression by incorporating the covariance information provided by the Gaussian Process (GP) model. This acquisition function specializes to the classical noise-free result, and we argue should replace that formula in Bayesian optimization software packages, tutorials, and textbooks. This enhanced acquisition provides good generality for noisy and noiseless settings. We show that our method achieves a sublinear convergence rate on the cumulative regret bound under heteroscedastic observation noise. Our empirical results demonstrate that our proposed acquisition function can outperform EI in the presence of noisy observations on benchmark functions for black-box optimization, as well as on parameter search for neural network model compression.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 9 of its 27 references that are in the map. First posted on arXiv 8 Oct 2023.
Builds on
9 of 27 references.
References · 9
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 306
- 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 204
- 2017Constrained Bayesian Optimization with Noisy Experimentscited by 104
- 2015Convolutional neural networks with low-rank regularizationcited by 103
- 2014Theoretical Analysis of Bayesian Optimisation with Unknown Gaussian Process Hyper-Parameterscited by 31
- 2022Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimizationcited by 15
Built on by
Citing papers per year: 2025: 4; 2026: 1.
5 papers.
- 2025Cost-aware Stopping for Bayesian Optimizationcited by 4
- 2025Comparative Explanations: Explanation Guided Decision Making for Human-in-the-Loop Preference Selectioncited by 2
- 2025Bayesian Optimization over Bounded Domains with the Beta Product Kernelcited by 1
- 2025Multi-Variable Batch Bayesian Optimization in Materials Research: Synthetic Data Analysis of Noise Sensitivity and Problem Landscape Effectscited by 0
- 2026Accelerated Discovery of Cryoprotectant Cocktails via Multi-Objective Bayesian Optimizationcited by 0
- 2026Accelerated Discovery of Cryoprotectant Cocktails via Multi-Objective Bayesian Optimization13 Feb 2026
- 2025Cost-aware Stopping for Bayesian Optimization16 Jul 2025
- 2025Bayesian Optimization over Bounded Domains with the Beta Product Kernel19 Jun 2025
- 2025Multi-Variable Batch Bayesian Optimization in Materials Research: Synthetic Data Analysis of Noise Sensitivity and Problem Landscape Effects4 Apr 2025
- 2025Comparative Explanations: Explanation Guided Decision Making for Human-in-the-Loop Preference Selection1 Apr 2025