Evolved Policy Gradients

We propose a metalearning approach for learning gradient-based reinforcement learning (RL) algorithms. The idea is to evolve a differentiable loss function, such that an agent, which optimizes its policy to minimize this loss, will achieve high rewards. The loss is parametrized via temporal convolutions over the agent's experience. Because this loss is highly flexible in its ability to take into account the agent's history, it enables fast task learning. Empirical results show that our evolved policy gradient algorithm (EPG) achieves faster learning on several randomized environments compared to an off-the-shelf policy gradient method. We also demonstrate that EPG's learned loss can generalize to out-of-distribution test time tasks, and exhibits qualitatively different behavior from other popular metalearning algorithms.

Authors

• Rein Houthooft
• Yuhua Chen
• Phillip Isola
• Bradly Stadie UC Berkeley
• Filip Wolski OpenAI
• OpenAI Jonathan Ho OpenAI, UC Berkeley
• Pieter Abbeel UC Berkeley

Keywords

No keywords are indexed for this paper.