arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1604.08153cs.LGcs.AIstat.ML

Classifying Options for Deep Reinforcement Learning

  • Imperial College London(帝国理工学院)

机构由 AI 辅助整理,请以论文原文为准。

Kai Arulkumaran, Nat Dilokthanakul, Murray Shanahan, Anil Anthony Bharath

更新

英文摘要

In this paper we combine one method for hierarchical reinforcement learning - the options framework - with deep Q-networks (DQNs) through the use of different "option heads" on the policy network, and a supervisory network for choosing between the different options. We utilise our setup to investigate the effects of architectural constraints in subtasks with positive and negative transfer, across a range of network capacities. We empirically show that our augmented DQN has lower sample complexity when simultaneously learning subtasks with negative transfer, without degrading performance when learning subtasks with positive transfer.

补充信息

↑