Optimal Strategies for Graph-Structured Bandits
Document type :
Pré-publication ou Document de travail
Permalink :
Title :
Optimal Strategies for Graph-Structured Bandits
Author(s) :
Saber, Hassan [Auteur]
Sequential Learning [SEQUEL]
Ménard, Pierre [Auteur]
Sequential Learning [SEQUEL]
Maillard, Odalric-Ambrym [Auteur]
Sequential Learning [SEQUEL]
Sequential Learning [SEQUEL]
Ménard, Pierre [Auteur]
Sequential Learning [SEQUEL]
Maillard, Odalric-Ambrym [Auteur]

Sequential Learning [SEQUEL]
English keyword(s) :
Asymptotic optimality
Regret analysis
Graph-structured stochastic bandits
Indexed Minimum Empirical Divergence (IMED)
Regret analysis
Graph-structured stochastic bandits
Indexed Minimum Empirical Divergence (IMED)
HAL domain(s) :
Statistiques [stat]/Machine Learning [stat.ML]
Informatique [cs]/Théorie de l'information [cs.IT]
Informatique [cs]/Théorie de l'information [cs.IT]
Language :
Anglais
Collections :
Source :
Submission date :
2020-07-09T01:00:58Z
Files
- https://hal.archives-ouvertes.fr/hal-02891139/document
- Open access
- Access the document
- http://arxiv.org/pdf/2007.03224
- Open access
- Access the document