Sample Complexity of Episodic Fixed-Horizon Reinforcement Learning

Christoph Dann, Emma Brunskill

stat.ML cs.AI cs.LG

Annotations (0)

No annotations yet.

Select any passage to add the first one.

References

Near-optimal Regret Bounds for Reinforcement Learning

P. Auer · 2008

Empirical Bernstein Bounds and Sample-Variance Penalization

Andreas Maurer et al. · 2009670 cit.

An analysis of model-based Interval Estimation for Markov Decision Processes

Alexander L. Strehl · 2008

Reinforcement Learning in Finite MDPs: PAC Analysis

Alexander L. Strehl · 2009

Near-Bayesian exploration in polynomial time

J. Kolter · 2009

PAC Bounds for Discounted MDPs

Tor Lattimore et al. · 2012198 cit.

paper7 papers following open source