Gaussian process bandits with adaptive discretization (Q1711556)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7003231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gaussian process bandits with adaptive discretization |
scientific article; zbMATH DE number 7003231 |
Statements
Gaussian process bandits with adaptive discretization (English)
0 references
18 January 2019
0 references
Problem: a black-box function is needed to be maximized in the Bayesian framework with a Gaussian process prior. A very illustrative title is given for the paper: Gaussian process bandits with adaptive discretization. A very nice statistical description is given to it, namely: \begin{itemize}\item general approach, \item tree based algorithm, \item analysis of algorithm like assumptions on the covariance function, details of the algorithm, regret bounds.\end{itemize} Computational benefits of the adaptivity, improved bounds for Matérn kernels, regret under noiseless observations are described. This paper gives several alternatives to the extensions. This work explains the algorithm very detailed.
0 references
Gaussian processes
0 references
bandits
0 references
Bayesian optimization
0 references
0 references
0 references
0.8028192520141602
0 references
0.7541754841804504
0 references
0.753582775592804
0 references
0.7471473813056946
0 references