Establishes a regret lower bound proving that polynomial effective optimism rules out minimax-optimal rates for GP-UCB on Matérn kernels under uniform confidence.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2486--2495
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Suboptimality of GP-UCB under Polynomial Effective Optimism
Establishes a regret lower bound proving that polynomial effective optimism rules out minimax-optimal rates for GP-UCB on Matérn kernels under uniform confidence.