Hindsight Foresight Relabeling for Meta-Reinforcement Learning

Abstract

Meta-reinforcement learning (meta-RL) algorithms allow for agents to learn new behaviors from small amounts of experience, mitigating the sample inefficiency problem in RL. However, while meta-RL agents can adapt quickly to new tasks at test time after experiencing only a few trajectories, the meta-training process is still sample-inefficient. Prior works have found that in the multi-task RL setting, relabeling past transitions and thus sharing experience among tasks can improve sample efficiency and asymptotic performance. We apply this idea to the meta-RL setting and devise a new relabeling method called Hindsight Foresight Relabeling (HFR). We construct a relabeling distribution using the combination of "hindsight", which is used to relabel trajectories using reward functions from the training task distribution, and "foresight", which takes the relabeled trajectories and computes the utility of each trajectory for each task. HFR is easy to implement and readily compatible with existing meta-RL algorithms. We find that HFR improves performance when compared to other relabeling methods on a variety of meta-RL tasks.

ICLR 2022 camera-ready

References in corpus (9)

• RL${}^2$: Fast Reinforcement Learning via Slow Reinforcement Learning
• Learning to reinforcement learn
• Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variables
• VariBAD: A Very Good Method for Bayes-Adaptive Deep RL via Meta-Learning
• Rewriting History with Inverse RL: Hindsight Inference for Policy Improvement
• Generalized Hindsight for Reinforcement Learning
• Meta-Reinforcement Learning Robust to Distributional Shift via Model Identification and Experience Relabeling
• Offline Meta Learning of Exploration
• Decoupling Exploration and Exploitation for Meta-Reinforcement Learning without Sacrifices