Demo Data from VLDB 2026 / reviewers in the wild / expert
Koanho Lee
dblp:349/0264
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Representation and self-supervised learning · 91% Reinforcement learning · 9% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation learning
feature decorrelation |
0.7 | 1 | 2023 | On the Importance of Feature Decorrelation for Unsupervised Representation Learning in Reinforcement Learning · ICML 2023 |
Machine learning › Representation and self-supervised learning › representation analysis
representation collapse |
0.7 | 1 | 2023 | On the Importance of Feature Decorrelation for Unsupervised Representation Learning in Reinforcement Learning · ICML 2023 |
Machine learning › Representation and self-supervised learning › representation learning
unsupervised representation learning |
0.7 | 1 | 2023 | On the Importance of Feature Decorrelation for Unsupervised Representation Learning in Reinforcement Learning · ICML 2023 |
Machine learning › Reinforcement learning
sample efficiency |
0.2 | 1 | 2023 | On the Importance of Feature Decorrelation for Unsupervised Representation Learning in Reinforcement Learning · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
feature decorrelation · 0.7causal prediction · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | On the Importance of Feature Decorrelation for Unsupervised Representation Learning in Reinforcement LearningabstractRecently, 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 methods on the Atari 100k benchmark. The code is available at https://github.com/dojeon-ai/SimTPR. Koanho Lee, Dongyoon Hwang, Byungkun Lee, Jaegul Choo |
ICML | 2 |