mlsanityData to 14 Oct 2026

Principled Design of Expected Improvement for Continuous Simulation Optimization

arXiv 2610.18434 ↗First posted 13 Oct 2026stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Expected improvement based on stochastic kriging (SK) surrogate is widely used in continuous simulation optimization, but unknown heteroscedastic noise makes three basic design choices consequential: the incumbent to define improvement, replication allocation, and final recommendation. Existing methods typically either assume the noise levels are known or choose these components separately through heuristic rules or empirical calibration. We instead derive a high-probability upper bound on the simple regret and systematically choose the three components within general rule classes to tighten this bound. We first establish a finite-sample confidence bound for the SK predictor as a foundation for the three design choices. Within general posterior-quantile rule classes, tightening the regret certificate selects a lower-quantile incumbent and an upper-quantile recommendation among sampled designs. The opposing quantiles reflect the different roles of exploratory experiments and the final implemented decision. Under mild conditions satisfied by common kernels, minimizing a tractable kernel-specific bound yields a logarithmic replication order. Based on these design choices, the resulting simple regret matches the existing results under known homoscedastic noise up to logarithmic factors. To our knowledge, this is the first simple-regret guarantee of this form for a continuous-domain EI-type simulation optimization method that learns unknown heteroscedastic variances through replications.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 41 references that are in the map. First posted on arXiv 13 Oct 2026.

Builds on

18 of 41 references.

References · 18

  1. 2017On Kernelized Multi-armed Banditscited by 352
  2. 2020On Information Gain and Regret Bounds in Gaussian Process Banditscited by 158
  3. 2018Information Directed Sampling and Bandits with Heteroscedastic Noisecited by 76
  4. 2016The Parallel Knowledge Gradient Method for Batch Bayesian Optimizationcited by 74
  5. 2021Optimal Order Simple Regret for Gaussian Process Banditscited by 54
  6. 2016Parallel Bayesian Global Optimization of Expensive Functionscited by 44
  7. 2014Theoretical Analysis of Bayesian Optimisation with Unknown Gaussian Process Hyper-Parameterscited by 31
  8. 2020On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimizationcited by 31
  9. 2017Replication or exploration? Sequential design for stochastic simulation experimentscited by 30
  10. 2017Simulation optimization: A review of algorithms and applicationscited by 23
  11. 2023Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Boundscited by 16
  12. 2022Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimizationcited by 15
6 more
  1. 2022Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Timescited by 13
  2. 2019Bayesian Optimization Allowing for Common Random Numberscited by 9
  3. 2023Batch Bayesian Optimization for Replicable Experimental Designcited by 8
  4. 2022Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimizationcited by 6
  5. 2021Combined Global and Local Search for Optimization with Gaussian Process Modelscited by 4
  6. 2025Regret Analysis of Posterior Sampling-Based Expected Improvement for Bayesian Optimizationcited by 4

Built on by

Not cited yet.