ICML 2020poster15 citations
Asynchronous Coagent Networks
James Kostas, Chris Nota, Philip Thomas
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.
BibTeX
@InProceedings{pmlr-v119-kostas20a,
title = {Asynchronous Coagent Networks},
author = {Kostas, James and Nota, Chris and Thomas, Philip},
booktitle = {Proceedings of the 37th International Conference on Machine Learning},
pages = {5426--5435},
year = {2020},
editor = {III, Hal Daumé and Singh, Aarti},
volume = {119},
series = {Proceedings of Machine Learning Research},
month = {13--18 Jul},
publisher = {PMLR},
pdf = {http://proceedings.mlr.press/v119/kostas20a/kostas20a.pdf},
url = {https://proceedings.mlr.press/v119/kostas20a.html},
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.}
}