12/07/2020

Asynchronous Coagent Networks

James Kostas, Chris Nota, Philip Thomas

Keywords: Reinforcement Learning - General

Abstract Paper Similar Papers

Abstract: Coagent policy gradient algorithms (CPGAs) are reinforcement learning algorithms for training a class of stochastic neural networks called coagent networks. In this work, we prove that CPGAs converge to locally optimal policies. Additionally, we extend prior theory to encompass asynchronous and recurrent coagent networks. These extensions facilitate the straightforward design and analysis of hierarchical reinforcement learning algorithms like the option-critic, and eliminate the need for complex derivations of customized learning rules for these algorithms.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at ICML 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 3:02 
 0
 0
 0
 0
 5:41 
 0
 0
 0
 0
 5:16 
 0
 0
 0
 0
 5:20 
 0
 0
 0
 0
 15:12 
 0
 0
 0
 0
 10:52 
 0
 0
 0
 0
 4:25 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 2:44 
 0
 0
 0
 0
 4:27 
 0
 0
 0
 0
 14:47 
 0
 0
 0
 0
 5:14 
 0
 0
 0
 0
 15:12 
 0
 0
 0
 0
 3:08 
 0
 0
 0
 0
 14:16 
 0
 0
 0
 0
 12:51 
 0
 0
 0
 0
 16:08 
 0
 0
 0
 0
 20:40 
 0
 0
 0
 0
 4:31 
 0
 0
 0
 0
 18:48 
 0
 0
 0
 0
 15:13 
 0
 0
 0
 0
 5:18 
 0
 0
 0
 0
 15:08 
 0
 0
 0
 0
 3:13 
 0
 0
 0
 0
 14:35 
 0
 0
 0
 0
 8:47 
 0
 0
 0
 0
 8:19 
 0
 0
 0
 0
 4:58 
 0
 0
 0
 0
 6:26 
 0
 0
 0
 0
 15:26 
 0
 0
 0
 0
 15:58 
 0
 0
 0
 0
 3:24 
 0
 0
 0
 0
 13:45 
 0
 0
 0
 0
 4:49 
 0
 0
 0
 0
 3:13 
 0
 0
 0
 0
 3:25 
 0
 0
 0
 0
 7:15 
 0
 0
 0
 0
 18:52 
 0
 0
 0
 0
 10:33 
 0
 0
 0
 0
 14:46