Meta Reinforcement Learning (RL) methods focus on automating the design of RL algorithms that generalize to a wide range of environments. The framework introduced in Co-Reyes et al., 2021 addresses the problem by representing different RL algorithms as Directed Acyclic Graphs (DAG), and using an evolutionary meta learner to modify these graphs and find good agent update rules. While the search language used to generate graphs in the paper serves to represent numerous already-existing RL algorithms (e.g., DQN, DDQN), it has limitations when it comes to representing Policy Gradient algorithms. In this work we try to close this gap by extending the original search language and proposing graphs for different Policy Gradient algorithms.
This work was done as part of the final project for the class 6.883 Meta Learning at MIT. Link to arXiv paper. To cite this repository in publications:
@misc{policygradientdag,
author = {Garau Luis, Juan Jose},
title = {Policy Gradient RL Algorithms as Directed Acyclic Graphs},
year = {2020},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/jjgarau/DAGPolicyGradient}},
}
