Offline-to-Online Reinforcement Learning via Balanced Replay and Pessimistic Q-Ensemble
원문 초록
Recent advance in deep offline reinforcement learning (RL) has made it possible to train strong robotic agents from offline datasets. However, depending on the quality of the trained agents and the application being considered, it is often desirable to fine-tune such agents via further online interactions. In this paper, we observe that state-action distribution shift may lead to severe bootstrap error during fine-tuning, which destroys the good initial policy obtained via offline RL. To address this issue, we first propose a balanced replay scheme that prioritizes samples encountered online while also encouraging the use of near-on-policy samples from the offline dataset. Furthermore, we leverage multiple Q-functions trained pessimistically offline, thereby preventing overoptimism concerning unfamiliar actions at novel states during the initial training phase. We show that the proposed method improves sample-efficiency and final performance of the fine-tuned robotic agents on various locomotion and manipulation tasks. Our code is available at: https://github.com/shlee94/Off2OnRL.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity
DR-SAC: Distributionally Robust Soft Actor-Critic for Reinforcement Learning under Uncertainty
From Novelty to Imitation: Self-Distilled Rewards for Offline Reinforcement Learning
Policy-Based Trajectory Clustering in Offline Reinforcement Learning
High-Throughput Distributed Reinforcement Learning via Adaptive Policy Synchronization
Step-wise Policy for Rare-tool Knowledge (SPaRK): Offline RL that Drives Diverse Tool Use in LLMs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.