Differentiating the multipoint Expected Improvement for optimal batch design
S\'ebastien Marmin (I2M, IRSN, IMSV), Cl\'ement Chevalier, David, Ginsbourger (IMSV)

TL;DR
This paper improves the computational efficiency of the multipoint Expected Improvement criterion in Bayesian optimization by deriving a closed-form gradient, enabling faster batch selection in Gaussian process-based optimization.
Contribution
It provides a closed-form gradient expression for the multipoint Expected Improvement, facilitating gradient-based optimization and computational savings in batch Bayesian optimization.
Findings
Significant computational savings demonstrated.
Gradient-based optimization outperforms existing methods.
Effective batch design combining UCB and EI approaches.
Abstract
This work deals with parallel optimization of expensive objective functions which are modeled as sample realizations of Gaussian processes. The study is formalized as a Bayesian optimization problem, or continuous multi-armed bandit problem, where a batch of q > 0 arms is pulled in parallel at each iteration. Several algorithms have been developed for choosing batches by trading off exploitation and exploration. As of today, the maximum Expected Improvement (EI) and Upper Confidence Bound (UCB) selection rules appear as the most prominent approaches for batch selection. Here, we build upon recent work on the multipoint Expected Improvement criterion, for which an analytic expansion relying on Tallis' formula was recently established. The computational burden of this selection rule being still an issue in application, we derive a closed-form expression for the gradient of the multipoint…
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.
Taxonomy
MethodsGaussian Process
