Sensitive discount optimality Unifying discounted and average reward reinforcement learning.pdfVIP
- 1、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Sensitive discount optimality Unifying discounted and average reward reinforcement learning
Sensitive Discount Optimality: Unifying Discounted andAverage Reward Reinforcement LearningSridhar Mahadevan Department of Computer Science and EngineeringUniversity of South FloridaTampa, Florida 33620Tel: (813) 974-3260mahadeva@csee.usf.eduMarch 12, 1996AbstractResearch in reinforcement learning (RL) has thus far concentrated on two optimalitycriteria: the discounted framework, which has been very well-studied, and the average-reward framework, in which interest is rapidly increasing. In this paper, we present aframework called sensitive discount optimality which oers an elegant way of linkingthese two paradigms. Although sensitive discount optimality has been well studied indynamic programming, with several provably convergent algorithms, it has not receivedany attention in RL. This framework is based on studying the properties of the expectedcumulative discounted reward, as discounting tends to 1. Under these conditions, thecumulative discounted reward can be expanded using a Laurent series expansion toyields a sequence of terms, the rst of which is the average reward, the second involvesthe average adjusted sum of rewards (or bias), etc. We use the sensitive discountoptimality framework to derive a new model-free average reward technique, which isrelated to Q-learning type methods proposed by Bertsekas, Schwartz, and Singh, butwhich unlike these previous methods, optimizes both the rst and second terms in theLaurent series (average reward and bias values).Keywords: Reinforcement learning, Average Reward.Statement: This paper has not been submitted to any other conference.This research is supported by a National Science Foundation CAREER Award Grant No. IRI-9501852.This paper is to appear in the 13th International Conference on Machine Learning (IMLC-96), Bari, Italy,July 3rd-6th. 1 1 MotivationReinforcement learning (RL) has become one of the most actively studied areas in machinelearning [7, 20]. Thus far, the work in RL has concentrated on one of two opt
您可能关注的文档
- PIC16LF1902-ISS;PIC16LF1902-ISO;PIC16LF1903-ISS;PIC16LF1902-IMV;中文规格书,Datasheet资料.pdf
- piezoresistive silicon pressure transmitter.pdf
- PIP 5S Sweep.ppt
- PIPE SUPPORT STAND INDEX.pdf
- Physical Consequences of a Momenta-Transfering Particle Theory of Induced Gravity and New M.pdf
- Photometric Observations of Omega Centauri Multi-Wavelength Observations of Evolved Stars.pdf
- PJ0400-x004E-R00 1C0616-RB1000-WSC-spec.pdf
- pixel people合成攻略.pdf
- Placement_Test带答案.doc
- planesweep.pdf
- sensitivity calculation.pdf
- Separation-Sensitive Collision Detection for Convex Objects.pdf
- Serial-ATA IDE Card.pdf
- Serulian Final Project Description Project Name Serulian.pdf
- ServerSocket用法详解.pdf
- Setup Smith V3.10.pdf
- Severe Sepsis and Septic Shock.pdf
- SFPE smoke filling.pdf
- SGM41000YXDT REV.A_20160919.pdf
- Shadow puppet plays.ppt
文档评论(0)