A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning
Eric Brochu, Vlad M. Cora, Nando de Freitas
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/kubeflow/katibpytorch★ 1,669
- github.com/jbrea/BayesianOptimization.jlnone★ 0
- github.com/Somya-Patra/Shell_ainone★ 0
- github.com/JohnYKiyo/coco_trialnone★ 0
- github.com/fmfn/BayesianOptimizationnone★ 0
- github.com/zatang007/BayesianOptimizationnone★ 0
- github.com/gaetanserre/stochastic-global-optimizationnone★ 0
- github.com/toniesteves/cnn-bayesian-optimizationtf★ 0
- github.com/chariff/GPronone★ 0
- github.com/yiyuezhuo/A-Tutorial-on-Bayesian-Optimization-exmaplenone★ 0
Abstract
We present a tutorial on Bayesian optimization, a method of finding the maximum of expensive cost functions. Bayesian optimization employs the Bayesian technique of setting a prior over the objective function and combining it with evidence to get a posterior function. This permits a utility-based selection of the next observation to make on the objective function, which must take into account both exploration (sampling from areas of high uncertainty) and exploitation (sampling areas likely to offer improvement over the current best observation). We also present two detailed extensions of Bayesian optimization, with experiments---active user modelling with preferences, and hierarchical reinforcement learning---and a discussion of the pros and cons of Bayesian optimization based on our experiences.