Skip to Main content Skip to Navigation
Conference papers

Online learning with Erdős-Rényi side-observation graphs

Tomáš Kocák 1 Gergely Neu 1, 2 Michal Valko 1
1 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : We consider adversarial multi-armed bandit problems where the learner is allowed to observe losses of a number of arms beside the arm that it actually chose. We study the case where all non-chosen arms reveal their loss with an unknown probability rt, independently of each other and the action of the learner. Moreover, we allow rt to change in every round t, which rules out the possibility of estimating rt by a well-concentrated sample average. We propose an algorithm which operates under the assumption that rt is large enough to warrant at least one side observation with high probability. We show that after T rounds in a bandit problem with N arms, the expected regret of our algorithm is of order O(sqrt(sum(t=1)T (1/rt) log N )), given that rt less than log T / (2N-2) for all t. All our bounds are within logarithmic factors of the best achievable performance of any algorithm that is even allowed to know exact values of rt.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Michal Valko Connect in order to contact the contributor
Submitted on : Tuesday, May 24, 2016 - 10:37:20 AM
Last modification on : Thursday, January 20, 2022 - 4:17:19 PM


Files produced by the author(s)


  • HAL Id : hal-01320588, version 1



Tomáš Kocák, Gergely Neu, Michal Valko. Online learning with Erdős-Rényi side-observation graphs. Uncertainty in Artificial Intelligence, Jun 2016, New York City, United States. ⟨hal-01320588⟩



Les métriques sont temporairement indisponibles