Pretraining a Shared Q-Network for Data-Efficient Offline Reinforcement Learning
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Offline RL with Smooth OOD Generalization in Convex Hull and its Neighborhood
From Novelty to Imitation: Self-Distilled Rewards for Offline Reinforcement Learning
Policy-Based Trajectory Clustering in Offline Reinforcement Learning
Fully Offline Reinforcement Learning
Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity
CAWR: Corruption-Averse Advantage-Weighted Regression for Robust Policy Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.