3.4k citations · 9.9k across the 108 of their papers we have counts for
Showing 2012 · cs.LGShow all
2 papers · 2 filters
cs.LG2012★ 32 cited
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…
cs.LG2012★ 42 cited
On the Sample Complexity of Reinforcement Learning with a Generative Model
Mohammad Gheshlaghi Azar, Remi Munos, Bert Kappen
We consider the problem of learning the optimal action-value function in the discounted-reward Markov decision processes (MDPs). We prove a new PAC bound on the sample-complexity o…