Raghuram Shankar
← Bayesian Optimization

Part 3 of 8

The Maths I: Gaussian Process Surrogates

Everything BO does flows through two numbers per candidate point — μn(x) and σn(x) — so this section builds the machine that produces them. Notation follows Frazier’s tutorial (and Garnett’s book): n observations X = (x1, …, xn) with values y = (y1, …, yn), maximization convention throughout.

  1. A prior over functions
  2. Conditioning: the posterior in closed form
  3. Choosing hyperparameters: the marginal likelihood
  4. Quiz: 5 questions