Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model

出版年份 2013 全文链接

标题

作者

关键词

Sample complexity, Markov decision processes, Reinforcement learning, Learning theory

出版物

Volume 91, Issue 3, Pages 325-349

出版商

Springer Nature

发表日期

2013-05-14

DOI

10.1007/s10994-013-5368-1

联系作者

Explore over 38,000 international journals covering a vast array of academic fields.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started