LGAIROOct 20, 2022

Hypernetworks in Meta-Reinforcement Learning

arXiv:2210.11348v151 citationsh-index: 67
AI Analysis

This work addresses sample inefficiency in meta-RL for robotics, offering an incremental improvement in hypernetwork initialization.

The paper tackles the problem of sample inefficiency in meta-reinforcement learning for robotics by addressing hypernetwork initialization sensitivity, proposing a novel initialization scheme that matches or exceeds state-of-the-art supervised methods and improves performance on simulated robotics benchmarks.

Training a reinforcement learning (RL) agent on a real-world robotics task remains generally impractical due to sample inefficiency. Multi-task RL and meta-RL aim to improve sample efficiency by generalizing over a distribution of related tasks. However, doing so is difficult in practice: In multi-task RL, state of the art methods often fail to outperform a degenerate solution that simply learns each task separately. Hypernetworks are a promising path forward since they replicate the separate policies of the degenerate solution while also allowing for generalization across tasks, and are applicable to meta-RL. However, evidence from supervised learning suggests hypernetwork performance is highly sensitive to the initialization. In this paper, we 1) show that hypernetwork initialization is also a critical factor in meta-RL, and that naive initializations yield poor performance; 2) propose a novel hypernetwork initialization scheme that matches or exceeds the performance of a state-of-the-art approach proposed for supervised settings, as well as being simpler and more general; and 3) use this method to show that hypernetworks can improve performance in meta-RL by evaluating on multiple simulated robotics benchmarks.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes