On the Sample Complexity of Reinforcement Learning Sham

@inproceedings{Gatsby2003OnTS,
  title={On the Sample Complexity of Reinforcement Learning Sham},
  author={Machandranath Kakade Gatsby},
  year={2003}
}
  • Machandranath Kakade Gatsby
  • Published 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? This question is analogous to the classical issue of the sample complexity in supervised learning, but is harder because of the increased realism of the reinforcement learning setting. This thesis summarizes recent sample complexity results in the reinforcement learning literature and builds on these results to provide novel… CONTINUE READING
Highly Influential
This paper has highly influenced 55 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 334 citations. REVIEW CITATIONS
200 Extracted Citations
63 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

335 Citations

0204060'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 335 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…