BO algorithms expand unknown search spaces via hyperharmonic series control to achieve sub-linear cumulative regret bounds, with a high-dimensional variant.
Unbounded bayesian optimization via regularization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2020 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces
BO algorithms expand unknown search spaces via hyperharmonic series control to achieve sub-linear cumulative regret bounds, with a high-dimensional variant.