Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

add link to tutorial in Bayesian optimization tutorial #421

Merged
merged 4 commits into from
Jul 19, 2024
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion tutorials/BayesianOptimizationDesign.md
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@ In this tutorial, we look at the design of spidr's Bayesian optimization functio

## A Bayesian optimization refresher

Techniques such as stochastic gradient descent excel at optimizing functions whose value and gradient are cheap to evaluate. But when function evaluations are expensive and the gradient is unknown, these techniques can be infeasible. In Bayesian optimization we approach such problems by placing a probabilistic model over historical function evaluations, and optimizing over this surrogate model instead. Model evaluations are cheap, and the gradients are known. A probabilistic model captures the uncertainty in the objective function as a posterior _distribution_, rather than a point. Bayesian optimization algorithms can make use of this predictive distribution in their own way in order to find the objective optimum, for example choosing a particular balance of exploration and exploitation.
Techniques such as stochastic gradient descent excel at optimizing functions whose value and gradient are cheap to evaluate. But when function evaluations are expensive and the gradient is unknown, these techniques can be infeasible. In [Bayesian optimization](https://arxiv.org/abs/1807.02811), we approach such problems by placing a probabilistic model over historical function evaluations, and optimizing over this surrogate model instead. Model evaluations are cheap, and the gradients are known. A probabilistic model captures the uncertainty in the objective function as a posterior _distribution_, rather than a point. Bayesian optimization algorithms can make use of this predictive distribution in their own way in order to find the objective optimum, for example choosing a particular balance of exploration and exploitation.

## Bayesian optimization design

Expand Down