Learning Successor Features the Simple Way
About
In Deep Reinforcement Learning (RL), it is a challenge to learn representations that do not exhibit catastrophic forgetting or interference in non-stationary environments. Successor Features (SFs) offer a potential solution to this challenge. However, canonical techniques for learning SFs from pixel-level observations often lead to representation collapse, wherein representations degenerate and fail to capture meaningful variations in the data. More recent methods for learning SFs can avoid representation collapse, but they often involve complex losses and multiple learning phases, reducing their efficiency. We introduce a novel, simple method for learning SFs directly from pixels. Our approach uses a combination of a Temporal-difference (TD) loss and a reward prediction loss, which together capture the basic mathematical definition of SFs. We show that our approach matches or outperforms existing SF learning techniques in both 2D (Minigrid), 3D (Miniworld) mazes and Mujoco, for both single and continual learning scenarios. As well, our technique is efficient, and can reach higher levels of performance in less time than other approaches. Our work provides a new, streamlined technique for learning SFs directly from pixel observations, with no pretraining required.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Language Conditioned Transfer | MiniGrid Reverse Task Case 3 (target) | Target Success Count (Case 3)38 | 6 | |
| Combined Generalization | MiniGrid (Case 2) | TGT Score4.8 | 6 | |
| Combined Generalization | MiniWorld (Case 2) | TGT Score (Case 2)0.00e+0 | 6 | |
| Generalization to Unseen Objects | MiniWorld Case 1: Unseen Objects v1 (test) | Target Score0.2 | 6 | |
| Generalization to Unseen Objects | MiniGrid Case 1: Unseen Objects v1 (test) | Target Generalization Score5.6 | 6 | |
| Language Conditioned Transfer | MiniWorld Reverse Task Case 3 (target) | Target Success Count (Case 3)0.00e+0 | 6 |