# Differentiating the multipoint Expected Improvement for optimal batch design

arXiv: https://arxiv.org/abs/1503.05509 · HTML: https://mlsanity.com/paper/1503.05509/

## Key facts

- Cited by 13 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Mar 2015.

## Built on by (most cited first, 13 of 13)

- [GIBBON: General-purpose Information-Based Bayesian OptimisatioN](https://mlsanity.com/paper/2102.03324/) (2021)
- [LLaMEA-BO: A Large Language Model Evolutionary Algorithm for Automatically Generating Bayesian Optimization Algorithms](https://mlsanity.com/paper/2505.21034/) (2025)
- [A portfolio approach to massively parallel Bayesian optimization](https://mlsanity.com/paper/2110.09334/) (2021)
- [New Paradigms for Exploiting Parallel Experiments in Bayesian Optimization](https://mlsanity.com/paper/2210.01071/) (2022)
- [Trusted-Maximizers Entropy Search for Efficient Bayesian Optimization](https://mlsanity.com/paper/2107.14465/) (2021)
- [SOBER: Highly Parallel Bayesian Optimization and Bayesian Quadrature over Discrete and Mixed Spaces](https://mlsanity.com/paper/2301.11832/) (2023)
- [Neural Stochastic Screened Poisson Reconstruction](https://mlsanity.com/paper/2309.11993/) (2023)
- [Randomized Kriging Believer for Parallel Bayesian Optimization with Regret Bounds](https://mlsanity.com/paper/2603.01470/) (2026)
- [A model aggregation approach for high-dimensional large-scale optimization](https://mlsanity.com/paper/2205.07525/) (2022)
- [Scalable Batch Bayesian Optimization Via Subspace Acquisition Functions](https://mlsanity.com/paper/2411.16206/) (2024)
- [Copula-enhanced Vision Transformer for high myopia diagnosis through OU UWF fundus images](https://mlsanity.com/paper/2501.06540/) (2025)
- [Adaptive Replication Strategies in Trust-Region-Based Bayesian Optimization of Stochastic Functions](https://mlsanity.com/paper/2504.20527/) (2025)
- [Cross-Modal Alignment via Variational Copula Modelling](https://mlsanity.com/paper/2511.03196/) (2025)

## Abstract (arXiv)

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 Expected Improvement, which aims at facilitating its maximization using gradient-based ascent algorithms. Substantial computational savings are shown in application. In addition, our algorithms are tested numerically and compared to state-of-the-art UCB-based batch-sequential algorithms. Combining starting designs relying on UCB with gradient-based EI local optimization finally appears as a sound option for batch design in distributed Gaussian Process optimization.