RAW-UCB achieves near-optimal regret in both rested and restless rotting bandits without prior knowledge of the setting or non-stationarity type.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A single algorithm for both restless and rested rotting bandits
RAW-UCB achieves near-optimal regret in both rested and restless rotting bandits without prior knowledge of the setting or non-stationarity type.