Corpus ID: 59669372

On the sample complexity of reinforcement learning.

@inproceedings{Kakade2003OnTS,
  title={On the sample complexity of reinforcement learning.},
  author={S. Kakade},
  year={2003}
}
This thesis is a detailed investigation into the following question: how much data must an agent collect in order to perform “reinforcement learning” successfully. [...] Key Method We build on the sample based algorithms suggested by Kearns, Mansour, and Ng [2000]. Their sample complexity bounds have no dependence on the size of the state space, an exponential dependence on the planning horizon time, and linear dependence on the complexity of . We suggest novel algorithms with more restricted guarantees whose…Expand
Reinforcement Learning via Online Linear Regression
Probably Approximately Correct (PAC) Exploration in Reinforcement Learning
  • A. Strehl
  • Mathematics, Computer Science
  • ISAIM
  • 2008
Is Q-learning Provably Efficient?
Model-based reinforcement learning with nearly tight exploration complexity bounds
Is Long Horizon RL More Difficult Than Short Horizon RL?
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 80 REFERENCES
...
1
2
3
4
5
...