Contrastive Retrospection: honing in on critical steps for rapid learning and generalization in RL
Not on the map. Why?
Abstract (arXiv)
In real life, success is often contingent upon multiple critical steps that are distant in time from each other and from the final reward. These critical steps are challenging to identify with traditional reinforcement learning (RL) methods that rely on the Bellman equation for credit assignment. Here, we present a new RL algorithm that uses offline contrastive learning to hone in on these critical steps. This algorithm, which we call Contrastive Retrospection (ConSpec), can be added to any existing RL algorithm. ConSpec learns a set of prototypes for the critical steps in a task by a novel contrastive loss and delivers an intrinsic reward when the current state matches one of the prototypes. The prototypes in ConSpec provide two key benefits for credit assignment: (i) They enable rapid identification of all the critical steps. (ii) They do so in a readily interpretable manner, enabling out-of-distribution generalization when sensory features are altered. Distinct from other contemporary RL approaches to credit assignment, ConSpec takes advantage of the fact that it is easier to retrospectively identify the small set of steps that success is contingent upon (and ignoring other states) than it is to prospectively predict reward at every taken step. ConSpec greatly improves learning in a diverse set of RL tasks. The code is available at the link: https://github.com/sunchipsster1/ConSpec
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 34 of its 59 references that are in the map. First posted on arXiv 12 Oct 2022.
Builds on
34 of 59 references.
References · 34
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,546
- 2015Prioritized Experience Replaycited by 1,099
- 2018Exploration by Random Network Distillationcited by 993
- 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 883
- 2020CURL: Contrastive Unsupervised Representations for Reinforcement Learningcited by 760
- 2019Leveraging Procedural Generation to Benchmark Reinforcement Learningcited by 483
- 2017Time-Contrastive Networks: Self-Supervised Learning from Videocited by 459
22 more
- 2018Data-Efficient Hierarchical Reinforcement Learningcited by 455
- 2016The Option-Critic Architecturecited by 448
- 2017FeUdal Networks for Hierarchical Reinforcement Learningcited by 337
- 2020Agent57: Outperforming the Atari Human Benchmarkcited by 303
- 2020First return, then explorecited by 266
- 2022Contrastive Learning as Goal-Conditioned Reinforcement Learningcited by 253
- 2018Unity: A General Platform for Intelligent Agentscited by 236
- 2019Recurrent Independent Mechanismscited by 219
- 2016A Connection between Generative Adversarial Networks, Inverse Reinforcement Learning, and Energy-Based Modelscited by 168
- 2017Neural Episodic Controlcited by 151
- 2019Unsupervised State Representation Learning in Ataricited by 144
- 2018Self-Imitation Learningcited by 138
- 2021Contrastive Behavioral Similarity Embeddings for Generalization in Reinforcement Learningcited by 123
- 2016Model-Free Episodic Controlcited by 102
- 2021Out of Distribution Generalization in Machine Learningcited by 60
- 2018Optimizing Agent Behavior over Long Time Scales by Transporting Valuecited by 58
- 2022Reinforcement Learning with Sparse Rewards using Guidance from Offline Demonstrationcited by 54
- 2020Object Files and Schemata: Factorizing Declarative and Procedural Knowledge in Dynamical Systemscited by 48
- 2020Align-RUDDER: Learning From Few Demonstrations by Reward Redistributioncited by 36
- 2020What can I do here? A Theory of Affordances in Reinforcement Learningcited by 35
- 2021Synthetic Returns for Long-Term Credit Assignmentcited by 27
- 2021Domain Adversarial Reinforcement Learningcited by 19
Built on by
Citing papers per year: 2024: 2; 2025: 2.
4 papers.
- 2025SAMULE: Self-Learning Agents Enhanced by Multi-level Reflectioncited by 15
- 2024Action abstractions for amortized samplingcited by 4
- 2024Learning Hidden Subgoals under Temporal Ordering Constraints in Reinforcement Learningcited by 1
- 2025The challenge of hidden gifts in multi-agent reinforcement learningcited by 1
- 2025SAMULE: Self-Learning Agents Enhanced by Multi-level Reflection24 Sep 2025
- 2025The challenge of hidden gifts in multi-agent reinforcement learning26 May 2025
- 2024Learning Hidden Subgoals under Temporal Ordering Constraints in Reinforcement Learning3 Nov 2024
- 2024Action abstractions for amortized sampling19 Oct 2024