BOO achieves exponentially decaying regret O(N^{-√N}) by combining Bayesian optimisation and partitioning-based optimistic optimisation for Matérn GP functions with ν > 4 + D/2.
The main difference between our proposed BOO algorithm and these algorithms are in the following blue color lines
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bayesian Optimistic Optimisation with Exponentially Decaying Regret
BOO achieves exponentially decaying regret O(N^{-√N}) by combining Bayesian optimisation and partitioning-based optimistic optimisation for Matérn GP functions with ν > 4 + D/2.