PAC Bounds for Discounted MDPs

Author:

Lattimore Tor,Hutter Marcus

Publisher

Springer Berlin Heidelberg

Reference15 articles.

1. Auer, P., Jaksch, T., Ortner, R.: Near-optimal regret bounds for reinforcement learning. J. Mach. Learn. Res. 99, 1563–1600 (2010)

2. Azar, M., Munos, R., Kappen, B.: On the sample complexity of reinforcement learning with a generative model. In: Proceedings of the 29th International Conference on Machine Learning. ACM, New York (2012)

3. Auer, P., Ortner, R.: Logarithmic online regret bounds for undiscounted reinforcement learning. In: Advances in Neural Information Processing Systems 19, pp. 49–56. MIT Press (2007)

4. Auer, P.: Upper confidence reinforcement learning. Unpublished, keynote at European Workshop of Reinforcement Learning (2011)

5. Chung, F., Lu, L.: Concentration inequalities and martingale inequalities a survey. Internet Mathematics 3, 1 (2006)

Cited by 68 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Probabilistic Contraction Analysis of Iterated Random Operators;IEEE Transactions on Automatic Control;2024-09

2. Delayed MDPs with Feature Mapping;2024 International Joint Conference on Neural Networks (IJCNN);2024-06-30

3. Provably Efficient Reinforcement Learning with Linear Function Approximation;Mathematics of Operations Research;2023-08

4. On the Benefits of Leveraging Structural Information in Planning Over the Learned Model;2023 American Control Conference (ACC);2023-05-31

5. Efficient Learning of High Level Plans from Play;2023 IEEE International Conference on Robotics and Automation (ICRA);2023-05-29

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3