liveBook · Manning

Batch expected improvement

As explained in Bayesian Optimization in Action

Batch expected improvement is a batch Bayesian optimization acquisition function that scores multiple candidate evaluations by their joint expected improvement over the incumbent.

Batch expected improvement scores several candidate evaluations jointly, favoring batches likely to improve on the incumbent while discouraging redundant, clustered queries. section 7.2.2

The batch perspective changes the acquisition decision in several ways:

  • A batch containing nearby points can waste parallel evaluations because its queries provide similar information. section 7.2.2
  • A preferred batch balances high predicted objective values with sufficient separation between queries. section 7.2.2
  • The best batch need not contain the point selected by sequential expected improvement. section 7.2.2

Two-point toy objective

For a one-dimensional objective, batch EI selects the symmetric pair 1.68 and 2.12 rather than sequential EI's single point at 1.75. Their separation avoids placing both evaluations near the same location. section 7.2.2

Figure 7.14 A heatmap showing the acquisition scores of the batch EI policy for batches of size 2 with a one-dimensional objective function. The top and right panels show the observed data and the current GP belief about the objective function along the axes of the heatmap. The two optimal pairs of queries, denoted as the two stars, contain 1.68 and 2.12, which are relatively far away from each other.

A heatmap makes joint batch scoring visible: the highest-scoring pair combines promising locations with meaningful separation. section 7.2.2

How Bayesian Optimization in Action covers it

How deep it goes
Explains joint batch scoring, diversification, and differences from sequential EI through a one-dimensional toy example.
Examples
Uses a one-dimensional heatmap, the pair 1.68 and 2.12, and SVM hyperparameter tuning with batches of four.
What you can do after
Apply it via BoTorch's qExpectedImprovement policy to optimize batches of candidate points.
How it connects
Connects Bayesian optimization with Gaussian processes, sequential expected improvement, probability of improvement, and upper confidence bound policies.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Bayesian Optimization in Action. The section links point to the parts of the book it draws on.