32 citations · 36 across the 3 of their papers we have counts for
3 papers
Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Bandits
Alexandra Carpentier, Alessandro Lazaric, Mohammad Ghavamzadeh +3
In this paper, we study the problem of estimating uniformly well the mean values of several distributions given a finite budget of samples. If the variance of the distributions wer…
Regret Bounds for Restless Markov Bandits
Ronald Ortner, Daniil Ryabko, Peter Auer +1
We consider the restless Markov bandit problem, in which the state of each arm evolves according to a Markov process independently of the learner's actions. We suggest an algorithm…
PAC-Bayesian Analysis of Martingales and Multiarmed Bandits
Yevgeny Seldin, François Laviolette, John Shawe-Taylor +2
We present two alternative ways to apply PAC-Bayesian analysis to sequences of dependent random variables. The first is based on a new lemma that enables to bound expectations of c…