Skip to Main content Skip to Navigation
Conference papers

A single algorithm for both restless and rested rotting bandits

Julien Seznec 1, 2 Pierre Menard 2 Alessandro Lazaric 3 Michal Valko 4 
2 Scool - Scool
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : In many application domains (e.g., recommender systems, intelligent tutoring systems), the rewards associated to the actions tend to decrease over time. This decay is either caused by the actions executed in the past (e.g., a user may get bored when songs of the same genre are recommended over and over) or by an external factor (e.g., content becomes outdated). These two situations can be modeled as specific instances of the rested and restless bandit settings, where arms are rotting (i.e., their value decrease over time). These problems were thought to be significantly different, since Levine et al. (2017) showed that state-of-the-art algorithms for restless bandit perform poorly in the rested rotting setting. In this paper, we introduce a novel algorithm, Rotting Adaptive Window UCB (RAW-UCB), that achieves near-optimal regret in both rotting rested and restless bandit, without any prior knowledge of the setting (rested or restless) and the type of non-stationarity (e.g., piece-wise constant, bounded variation). This is in striking contrast with previous negative results showing that no algorithm can achieve similar results as soon as rewards are allowed to increase. We confirm our theoretical findings on a number of synthetic and datasetbased experiments.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-03287835
Contributor : Michal Valko Connect in order to contact the contributor
Submitted on : Thursday, July 15, 2021 - 9:55:52 PM
Last modification on : Sunday, June 26, 2022 - 9:10:13 AM
Long-term archiving on: : Saturday, October 16, 2021 - 7:17:36 PM

File

seznec2020single.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03287835, version 1

Collections

Citation

Julien Seznec, Pierre Menard, Alessandro Lazaric, Michal Valko. A single algorithm for both restless and rested rotting bandits. International Conference on Artificial Intelligence and Statistics, Aug 2020, Palermo / Virtual, Italy. ⟨hal-03287835⟩

Share

Metrics

Record views

35

Files downloads

12