Extending Expected Improvement for High-dimensional Stochastic Optimization of Expensive Black-Box Functions
Piyush Pandita, Ilias Bilionis, Jitesh Panchal

TL;DR
This paper extends the expected improvement acquisition function within Bayesian optimization to handle high-dimensional stochastic problems with expensive black-box functions, incorporating uncertainty filtering and Bayesian hyperparameter inference.
Contribution
It introduces a robust EI-based Bayesian optimization method for uncertain, high-dimensional, expensive black-box functions, using a particle approximation of Gaussian process hyperparameters.
Findings
Successfully applied to synthetic problems with uncertainty.
Demonstrated effectiveness on oil-well placement under uncertainty.
Improved sample efficiency in high-dimensional stochastic optimization.
Abstract
Design optimization under uncertainty is notoriously difficult when the objective function is expensive to evaluate. State-of-the-art techniques, e.g, stochastic optimization or sampling average approximation, fail to learn exploitable patterns from collected data and require an excessive number of objective function evaluations. There is a need for techniques that alleviate the high cost of information acquisition and select sequential simulations optimally. In the field of deterministic single-objective unconstrained global optimization, the Bayesian global optimization (BGO) approach has been relatively successful in addressing the information acquisition problem. BGO builds a probabilistic surrogate of the expensive objective function and uses it to define an information acquisition function (IAF) whose role is to quantify the merit of making new objective evaluations. Specifically,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
