A new p-mean regret framework for stochastic bandits is proposed with an Explore-then-UCB algorithm, but the headline negative-p bounds are not reliably derived.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
p-Mean Regret for Stochastic Bandits
A new p-mean regret framework for stochastic bandits is proposed with an Explore-then-UCB algorithm, but the headline negative-p bounds are not reliably derived.