Quick-Draw is a fast kernel-interpolation UCB bandit for large-arm nonstationary problems, but the claimed O*(sqrt T) regret bound does not follow from the paper's theorem.
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
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms
Quick-Draw is a fast kernel-interpolation UCB bandit for large-arm nonstationary problems, but the claimed O*(sqrt T) regret bound does not follow from the paper's theorem.