Learning Successor Features the Simple Way
Raymond Chua, Arna Ghosh, Christos Kaplanis, Blake A. Richards, Doina Precup
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ca5d0b63-3c25-4ef1-91d7-bc919ee476c9Cited by top-tier papers6
- Reward-Aware Proto-Representations in Reinforcement LearningHon Tik Tse, Siddarth Chandrasekar, Marlos C. MachadoNeurIPS 2025 · 6 citations
- Constructing an Optimal Behavior Basis for the Option KeyboardLucas N. Alegre, Ana L. C. Bazzan, André Barreto, Bruno C. da SilvaNeurIPS 2025 · 4 citations
- A Reward-Free Viewpoint on Multi-Objective Reinforcement LearningYing-Tu Chen, Wei Hung, Bing-Shu Wu, Zhang-Wei Hong et al.ICLR 2026 · 2 citations
- Balancing Plasticity and Stability with Fast and Slow Successor FeaturesRaymond Chua, Doina Precup, Blake RichardsICML 2026
- Bridging Successor Measure and Online Policy Learning with Flow Matching-Based RepresentationsHaosen Shi, Jianda Chen, Sinno Jialin PanICLR 2026
Builds on16
- Mastering Visual Continuous Control: Improved Data-Augmented Reinforcement LearningDenis Yarats, Rob Fergus, Alessandro Lazaric, Lerrel PintoICLR 2022 · 457 citations
- Count-Based Exploration with the Successor RepresentationMarlos C. Machado, Marc G. Bellemare, Michael BowlingAAAI 2020 · 206 citations
- Fast Task Inference with Variational Intrinsic Successor FeaturesSteven Hansen, Will Dabney, André Barreto, David Warde-Farley et al.ICLR 2020 · 176 citations
- APS: Active Pretraining with Successor FeaturesHao Liu, Pieter AbbeelICML 2021 · 147 citations
- Optimistic Linear Support and Successor Features as a Basis for Optimal Policy TransferLucas Nunes Alegre, Ana L. C. Bazzan, Bruno C. da SilvaICML 2022 · 36 citations
Related papers
- Hierarchical Successor Representation for Robust TransferChangmin Yu, Máté LengyelICML 2026
- A Deep Reinforcement Learning Approach to Marginalized Importance Sampling with the Successor RepresentationScott Fujimoto, David Meger, Doina PrecupICML 2021 · 17 citations
- SimSR: Simple Distance-Based State Representations for Deep Reinforcement LearningHongyu Zang, Xin Li, Mingzhong WangAAAI 2022 · 20 citations
- Learning Robust Representations with Long-Term Information for Generalization in Visual Reinforcement LearningRui Yang, Jie Wang, Qijie Peng, Ruibo Guo et al.ICLR 2025
- Stabilizing Off-Policy Deep Reinforcement Learning from PixelsEdoardo Cetin, Philip J. Ball, Stephen J. Roberts, Oya ÇeliktutanICML 2022 · 43 citations
