liveBook · Manning

Expected improvement

As explained in AI-Powered Search

Expected improvement is a Bayesian-optimization acquisition function that scores candidates by their expected gain over the current best result while accounting for predictive uncertainty.

Expected improvement ranks exploration candidates by predicted upside, combining the opportunity to improve with the probability of improvement and predictive uncertainty. section 12.3.2

Exploring a Transformers DVD query

For the query "transformers dvd," the highest-scoring feature vector selects a product to test with live users. Increasing theta favors more conservative or higher-upside candidates according to the configured risk preference. section 12.3.2

How AI-Powered Search covers it

How deep it goes
Explains the basic formula and implementation, but defers advanced Bayesian-optimization details.
Examples
Uses product features, logged judgments, uncertainty tables, and a "transformers dvd" exploration query.
What it assumes
Assumes logged judgments and search features; supplies the Gaussian-process predictions and improvement calculation.
What you can do after
Apply it via Python to rank candidate feature vectors and select products for search-engine exploration.
How it connects
Connects Gaussian processes, Bayesian optimization, active learning, predictive uncertainty, and search ranking.

Also explained in

Compare how 2 books explain expected improvement →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of AI-Powered Search. The section links point to the parts of the book it draws on.