增强强化学习与目标辍学

Mark Jovic A. Daday, Kristoffer Franz Mari R. Millado
{"title":"增强强化学习与目标辍学","authors":"Mark Jovic A. Daday, Kristoffer Franz Mari R. Millado","doi":"10.1109/ICD47981.2019.9105750","DOIUrl":null,"url":null,"abstract":"In modern ages, the study on Reinforcement Learning (RL) has driven on Deep Q-Network (DQN) optimization learning prediction and control of Markov decision processes (MDPs). In this paper, the researcher used the Targeted Dropout strategy for RLs DQN that makes straight into learning and would be necessary to deal with MDPs with huge or continuous state and action spaces. Every weight/unit update, the targeted dropout selects a set of elements and to keep only the weights/units of maximum amount, and then apply dropout to the set. It has also a common pruning strategy so focus on fast approximations, such as removing weights with the smallest value or ranking the weights/units by the sensitivity of the network design and even rating by the sensitivity of the task execution with respect to the weights/units and removing the least-sensitive ones. The result shows that the proposed algorithm for enhancing the RL's DQN is more accurate in finding the best action to learn to achieve maximum reward. The simulation presents that in a minimal run of episodes it can achieve the maximum average reward, while without Targeted Dropout it takes more runs to achieve the average reward, and throughout the assessment of the algorithm, the suggested algorithm acquires more learning in finding the large reward value.","PeriodicalId":277894,"journal":{"name":"2019 International Conference on Digitization (ICD)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhanced Reinforcement Learning with Targeted Dropout\",\"authors\":\"Mark Jovic A. Daday, Kristoffer Franz Mari R. Millado\",\"doi\":\"10.1109/ICD47981.2019.9105750\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In modern ages, the study on Reinforcement Learning (RL) has driven on Deep Q-Network (DQN) optimization learning prediction and control of Markov decision processes (MDPs). In this paper, the researcher used the Targeted Dropout strategy for RLs DQN that makes straight into learning and would be necessary to deal with MDPs with huge or continuous state and action spaces. Every weight/unit update, the targeted dropout selects a set of elements and to keep only the weights/units of maximum amount, and then apply dropout to the set. It has also a common pruning strategy so focus on fast approximations, such as removing weights with the smallest value or ranking the weights/units by the sensitivity of the network design and even rating by the sensitivity of the task execution with respect to the weights/units and removing the least-sensitive ones. The result shows that the proposed algorithm for enhancing the RL's DQN is more accurate in finding the best action to learn to achieve maximum reward. The simulation presents that in a minimal run of episodes it can achieve the maximum average reward, while without Targeted Dropout it takes more runs to achieve the average reward, and throughout the assessment of the algorithm, the suggested algorithm acquires more learning in finding the large reward value.\",\"PeriodicalId\":277894,\"journal\":{\"name\":\"2019 International Conference on Digitization (ICD)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Digitization (ICD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICD47981.2019.9105750\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Digitization (ICD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICD47981.2019.9105750","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,强化学习(RL)的研究推动了深度q网络(DQN)对马尔可夫决策过程(mdp)的优化学习预测和控制。在本文中,研究人员对RLs DQN使用了Targeted Dropout策略,该策略直接进入学习,并且需要处理具有巨大或连续状态和动作空间的mdp。每次权重/单位更新,目标dropout选择一组元素,并只保留最大数量的权重/单位,然后将dropout应用于该集合。它还有一个通用的修剪策略,因此专注于快速逼近,例如删除具有最小值的权重或根据网络设计的灵敏度对权重/单元进行排序,甚至根据任务执行的灵敏度对权重/单元进行评级,并删除最不敏感的权重/单元。结果表明,本文提出的增强RL DQN的算法能够更准确地找到学习获得最大奖励的最佳动作。仿真结果表明,在最小的运行集内可以获得最大的平均奖励,而在没有Targeted Dropout的情况下,需要更多的运行集才能获得平均奖励,并且在整个算法的评估过程中,建议的算法在寻找较大的奖励值方面获得了更多的学习。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enhanced Reinforcement Learning with Targeted Dropout
In modern ages, the study on Reinforcement Learning (RL) has driven on Deep Q-Network (DQN) optimization learning prediction and control of Markov decision processes (MDPs). In this paper, the researcher used the Targeted Dropout strategy for RLs DQN that makes straight into learning and would be necessary to deal with MDPs with huge or continuous state and action spaces. Every weight/unit update, the targeted dropout selects a set of elements and to keep only the weights/units of maximum amount, and then apply dropout to the set. It has also a common pruning strategy so focus on fast approximations, such as removing weights with the smallest value or ranking the weights/units by the sensitivity of the network design and even rating by the sensitivity of the task execution with respect to the weights/units and removing the least-sensitive ones. The result shows that the proposed algorithm for enhancing the RL's DQN is more accurate in finding the best action to learn to achieve maximum reward. The simulation presents that in a minimal run of episodes it can achieve the maximum average reward, while without Targeted Dropout it takes more runs to achieve the average reward, and throughout the assessment of the algorithm, the suggested algorithm acquires more learning in finding the large reward value.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信