Learning Successor Features the Simple Way
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 21 of its 66 references that are in the map. First posted on arXiv 29 Oct 2024.
Builds on
21 of 66 references.
References · 21
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2021Mastering Visual Continuous Control: Improved Data-Augmented Reinforcement Learningcited by 359
- 2023Minigrid & Miniworld: Modular & Customizable Reinforcement Learning Environments for Goal-Oriented Taskscited by 320
- 2020Better Fine-Tuning by Reducing Representational Collapsecited by 156
- 2021URLB: Unsupervised Reinforcement Learning Benchmarkcited by 138
- 2019Fast Task Inference with Variational Intrinsic Successor Featurescited by 131
- 2023Loss of Plasticity in Continual Deep Reinforcement Learningcited by 118
- 2018Universal Successor Features Approximatorscited by 102
- 2017Eigenoption Discovery through the Deep Successor Representationcited by 85
- 2022Does Zero-Shot Reinforcement Learning Exist?cited by 79
- 2023Proto-Value Networks: Scaling Representation Learning with Auxiliary Taskscited by 41
9 more
- 2021PsiPhi-Learning: Reinforcement Learning with Demonstrations using Successor Features and Inverse Temporal Difference Learningcited by 23
- 2022Optimistic Linear Support and Successor Features as a Basis for Optimal Policy Transfercited by 22
- 2020Universal Successor Features for Transfer Reinforcement Learningcited by 20
- 2023Prediction and Control in Continual Reinforcement Learningcited by 19
- 2023Combining Behaviors with the Successor Features Keyboardcited by 12
- 2017Advantages and Limitations of using Successor Features for Transfer in Reinforcement Learningcited by 10
- 2023Composing Task Knowledge with Modular Successor Feature Approximatorscited by 7
- 2019Successor Features Combine Elements of Model-Free and Model-based Reinforcement Learningcited by 6
- 2021Successor Feature Representationscited by 6
Built on by
Citing papers per year: 2025: 5; 2026: 5.
10 papers.
- 2025A Survey of Continual Reinforcement Learningcited by 16
- 2025Reward-Aware Proto-Representations in Reinforcement Learningcited by 3
- 2025Constructing an Optimal Behavior Basis for the Option Keyboardcited by 2
- 2026A Reward-Free Viewpoint on Multi-Objective Reinforcement Learningcited by 2
- 2025MAGIK: Mapping to Analogous Goals via Imagination-enabled Knowledge Transfercited by 1
- 2026Reward-Conditioned Reinforcement Learningcited by 1
- 2025Robust Remote Reinforcement Learning over Unreliable Communication Channels using Homomorphic State Encodingcited by 0
- 2026Squeezing More from the Stream : Learning Representation Online for Streaming Reinforcement Learningcited by 0
- 2026ASPECT:Analogical Semantic Policy Execution via Language Conditioned Transfercited by 0
- 2026Robust Successor Featurescited by 0
- 2026Robust Successor Features25 Sep 2026
- 2026A Reward-Free Viewpoint on Multi-Objective Reinforcement Learning27 Apr 2026
- 2026ASPECT:Analogical Semantic Policy Execution via Language Conditioned Transfer9 Apr 2026
- 2026Reward-Conditioned Reinforcement Learning5 Mar 2026
- 2026Squeezing More from the Stream : Learning Representation Online for Streaming Reinforcement Learning10 Feb 2026
- 2025Robust Remote Reinforcement Learning over Unreliable Communication Channels using Homomorphic State Encoding11 Aug 2025
- 2025A Survey of Continual Reinforcement Learning27 Jun 2025
- 2025MAGIK: Mapping to Analogous Goals via Imagination-enabled Knowledge Transfer2 Jun 2025
- 2025Reward-Aware Proto-Representations in Reinforcement Learning22 May 2025
- 2025Constructing an Optimal Behavior Basis for the Option Keyboard1 May 2025