Papers › Unexpected Improvements to Expected Improvement for Bayesian Optimization

Unexpected Improvements to Expected Improvement for Bayesian Optimization

31 Oct 2023NeurIPS 2023 11arXiv:2310.20708archive 2025-07-28

Sebastian Ament, Samuel Daulton, David Eriksson, Maximilian Balandat, Eytan Bakshy

Expected Improvement (EI) is arguably the most popular acquisition function in Bayesian optimization and has found countless successful applications, but its performance is often exceeded by that of more recent methods. Notably, EI and its variants, including for the parallel and multi-objective settings, are challenging to optimize because their acquisition values vanish numerically in many regions. This difficulty generally increases as the number of observations, dimensionality of the search space, or the number of constraints grow, resulting in performance that is inconsistent across the literature and most often sub-optimal. Herein, we propose LogEI, a new family of acquisition functions whose members either have identical or approximately equal optima as their canonical counterparts, but are substantially easier to optimize numerically. We demonstrate that numerical pathologies manifest themselves in "classic" analytic EI, Expected Hypervolume Improvement (EHVI), as well as their constrained, noisy, and parallel variants, and propose corresponding reformulations that remedy these pathologies. Our empirical results show that members of the LogEI family of acquisition functions substantially improve on the optimization performance of their canonical counterparts and surprisingly, are on par with or exceed the performance of recent state-of-the-art acquisition functions, highlighting the understated role of numerical optimization in the literature.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2310.20708")

Code

Syntology Ran 0 of 9 code samples harvested from 1 repository linked to this paper; 9 have no recorded run.

By repository: community (archive-listed): 9 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

omerronen/scales mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 0 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

9unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from omerronen/scales. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

analyze_results omerronen/scales/les/analysis/opt_results.py community (archive-listed) unverified MIT (permissive) · a71685e684ff7417 · report
calculate_distance_to_train omerronen/scales/les/analysis/ood.py community (archive-listed) unverified MIT (permissive) · dc692d5ad7f839fc · report
fit_mll omerronen/scales/les/opt/bo.py community (archive-listed) unverified MIT (permissive) · 8ea028fc68384ad8 · report
get_f_config omerronen/scales/les/nets/utils.py community (archive-listed) unverified MIT (permissive) · ba2b2491a287f01e · report
mean omerronen/scales/les/analysis/opt_results.py community (archive-listed) unverified MIT (permissive) · fefc89892209bb98 · report
normalize omerronen/scales/les/opt/bo.py community (archive-listed) unverified MIT (permissive) · cfb615172f69f27e · report
sem omerronen/scales/les/analysis/opt_results.py community (archive-listed) unverified MIT (permissive) · 2a3bcb1b2a8a09ad · report
unnormalize omerronen/scales/les/opt/bo.py community (archive-listed) unverified MIT (permissive) · b1ad8495ae416cec · report
wall_clock omerronen/scales/les/analysis/wall_clock.py community (archive-listed) unverified MIT (permissive) · bfb877ba00317767 · report

Tasks

Bayesian Optimization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections