AILGMay 9, 2025

Pretraining a Shared Q-Network for Data-Efficient Offline Reinforcement Learning

arXiv:2505.05701v21 citationsh-index: 1
Originality Incremental advance
AI Analysis

This work addresses the challenge of learning effective policies with minimal static datasets in offline RL, which is crucial when environment interactions are restricted, though it appears incremental as it builds upon existing methods.

The paper tackles the problem of data efficiency in offline reinforcement learning by proposing a pretraining method for a shared Q-network, which enhances performance across multiple benchmarks, notably achieving better results with only 10% of the dataset compared to standard methods using full datasets.

Offline reinforcement learning (RL) aims to learn a policy from a static dataset without further interactions with the environment. Collecting sufficiently large datasets for offline RL is exhausting since this data collection requires colossus interactions with environments and becomes tricky when the interaction with the environment is restricted. Hence, how an agent learns the best policy with a minimal static dataset is a crucial issue in offline RL, similar to the sample efficiency problem in online RL. In this paper, we propose a simple yet effective plug-and-play pretraining method to initialize a feature of a Q-network to enhance data efficiency in offline RL. Specifically, we introduce a shared Q-network structure that outputs predictions of the next state and Q-value. We pretrain the shared Q-network through a supervised regression task that predicts a next state and trains the shared Q-network using diverse offline RL methods. Through extensive experiments, we empirically demonstrate that our method enhances the performance of existing popular offline RL methods on the D4RL, Robomimic and V-D4RL benchmarks. Furthermore, we show that our method significantly boosts data-efficient offline RL across various data qualities and data distributions trough D4RL and ExoRL benchmarks. Notably, our method adapted with only 10% of the dataset outperforms standard algorithms even with full datasets.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes