153 citations · 1.2k across the 73 of their papers we have counts for
1 paper · 2 filters
Tor Lattimore, Marcus Hutter
We study upper and lower bounds on the sample-complexity of learning near-optimal behaviour in finite-state discounted Markov Decision Processes (MDPs). For the upper bound we make…