Leveraging Skills from Unlabeled Prior Data for Efficient Online Exploration

Max Wilcoxson, Qiyang Li, Kevin Frans, Sergey Levine
2/12/2026

No official code found. Best implementation: rail-berkeley/SUPE (39 stars, MIT, last commit 2025-07-11).

Abstract

Unsupervised pretraining has been transformative in many supervised domains. However, applying such ideas to reinforcement learning (RL) presents a unique challenge in that fine-tuning does not involve mimicking task-specific data, but rather exploring and locating the solution through iterative self-improvement. In this work, we study how unlabeled offline trajectory data can be leveraged to learn efficient exploration strategies. While prior data can be used to pretrain a set of low-level skills, or as additional off-policy data for online RL, it has been unclear how to combine these ideas effectively for online exploration. Our method SUPE (Skills from Unlabeled Prior data for Exploration) demonstrates that a careful combination of these ideas compounds their benefits. Our method first extracts low-level skills using a variational autoencoder (VAE), and then pseudo-labels unlabeled trajectories with optimistic rewards and high-level action labels, transforming prior data into high-level, task-relevant examples that encourage novelty-seeking behavior. Finally, SUPE uses these transformed examples as additional off-policy data for online RL to learn a high-level policy that composes pretrained low-level skills to explore efficiently. In our experiments, SUPE consistently outperforms prior strategies across a suite of 42 long-horizon, sparse-reward tasks. Code: https://github.com/rail-berkeley/supe.

View on arXivView PDF

Code Implementations(1)

rail-berkeley/SUPECommunity58%
MIT

This code accompanies the paper "Leveraging Skills from Unlabeled Prior Data for Efficient Online Exploration."

394Shell, PythonOct 22, 20241 years agoMIT

Similar Papers

Cite this paper

@article{wilcoxson2026leveraging,
  title  = {Leveraging Skills from Unlabeled Prior Data for Efficient Online Exploration},
  author = {Max Wilcoxson and Qiyang Li and Kevin Frans and Sergey Levine},
  year   = {2026},
  eprint = {2410.18076},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2410.18076},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.18076.svg)](https://codeofpaper.com/paper/2410.18076)

Discussion