On the Importance of Feature Decorrelation for Unsupervised Representation Learning in Reinforcement Learning
Hojoon Lee, Koanho Lee, Dongyoon Hwang, Hyunho Lee and, Byungkun Lee, Jaegul Choo

TL;DR
This paper introduces a new unsupervised representation learning framework for reinforcement learning that decorrelates features in the latent space to prevent collapse, leading to improved sample efficiency on Atari benchmarks.
Contribution
It proposes a novel URL method that causally predicts future states and decorrelates features to enhance latent space quality, addressing representational collapse.
Findings
Effectively prevents latent space collapse
Significantly improves sample efficiency on Atari 100k
Outperforms existing URL methods
Abstract
Recently, unsupervised representation learning (URL) has improved the sample efficiency of Reinforcement Learning (RL) by pretraining a model from a large unlabeled dataset. The underlying principle of these methods is to learn temporally predictive representations by predicting future states in the latent space. However, an important challenge of this approach is the representational collapse, where the subspace of the latent representations collapses into a low-dimensional manifold. To address this issue, we propose a novel URL framework that causally predicts future states while increasing the dimension of the latent manifold by decorrelating the features in the latent space. Through extensive empirical studies, we demonstrate that our framework effectively learns predictive representations without collapse, which significantly improves the sample efficiency of state-of-the-art URL…
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.
Code & Models
Videos
Taxonomy
TopicsReinforcement Learning in Robotics · Domain Adaptation and Few-Shot Learning · Adversarial Robustness in Machine Learning
