A unified algorithm class, Generic-GP, uses scalar exploration distributions to interpolate between UCB and randomized exploration, achieving \tilde O(\gamma_T\sqrt T) regret in kernelized bandits.
Finite-time analysis of the multi-armed bandit problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Efficient kernelized bandit algorithms via exploration distributions
A unified algorithm class, Generic-GP, uses scalar exploration distributions to interpolate between UCB and randomized exploration, achieving \tilde O(\gamma_T\sqrt T) regret in kernelized bandits.