Contrastive Learning as Goal-Conditioned Reinforcement Learning
Benjamin Eysenbach, Tianjun Zhang, Ruslan Salakhutdinov, Sergey Levine

TL;DR
This paper introduces contrastive learning as a goal-conditioned reinforcement learning approach, enabling direct representation learning that improves success rates across various tasks without auxiliary losses.
Contribution
It reinterprets contrastive representation learning as a goal-conditioned RL method and proposes a simpler, effective algorithm outperforming prior approaches.
Findings
Contrastive RL achieves higher success rates than non-contrastive methods.
It outperforms prior methods on image-based tasks without data augmentation.
The approach is effective in offline RL settings.
Abstract
In reinforcement learning (RL), it is easier to solve a task if given a good representation. While deep RL should automatically acquire such good representations, prior work often finds that learning representations in an end-to-end fashion is unstable and instead equip RL algorithms with additional representation learning parts (e.g., auxiliary losses, data augmentation). How can we design RL algorithms that directly acquire good representations? In this paper, instead of adding representation learning parts to an existing RL algorithm, we show (contrastive) representation learning methods can be cast as RL algorithms in their own right. To do this, we build upon prior work and apply contrastive representation learning to action-labeled trajectories, in such a way that the (inner product of) learned representations exactly corresponds to a goal-conditioned value function. We use this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Reinforcement Learning in Robotics
