Continual Task Learning through Adaptive Policy Self-Composition

Shengchao Hu, Yuhang Zhou, Ziqing Fan, Jifeng Hu, Li Shen +2 more
11/18/2024
cs.LGcs.AI

No official code found. Best implementation: charleshsc/CompoFormer (5 stars, Apache-2.0, last commit 2024-11-19).

Abstract

Training a generalizable agent to continually learn a sequence of tasks from offline trajectories is a natural requirement for long-lived agents, yet remains a significant challenge for current offline reinforcement learning (RL) algorithms. Specifically, an agent must be able to rapidly adapt to new tasks using newly collected trajectories (plasticity), while retaining knowledge from previously learned tasks (stability). However, systematic analyses of this setting are scarce, and it remains unclear whether conventional continual learning (CL) methods are effective in continual offline RL (CORL) scenarios. In this study, we develop the Offline Continual World benchmark and demonstrate that traditional CL methods struggle with catastrophic forgetting, primarily due to the unique distribution shifts inherent to CORL scenarios. To address this challenge, we introduce CompoFormer, a structure-based continual transformer model that adaptively composes previous policies via a meta-policy network. Upon encountering a new task, CompoFormer leverages semantic correlations to selectively integrate relevant prior policies alongside newly trained parameters, thereby enhancing knowledge sharing and accelerating the learning process. Our experiments reveal that CompoFormer outperforms conventional CL methods, particularly in longer task sequences, showcasing a promising balance between plasticity and stability.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Continual Task Learning through Adaptive Policy Self-Composition

52Shell, PythonNov 18, 20241 years agoApache-2.0

Similar Papers

Cite this paper

@article{hu2024continual,
  title  = {Continual Task Learning through Adaptive Policy Self-Composition},
  author = {Shengchao Hu and Yuhang Zhou and Ziqing Fan and Jifeng Hu and Li Shen and Ya Zhang and Dacheng Tao},
  year   = {2024},
  eprint = {2411.11364},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.11364v1}
}

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/2411.11364.svg)](https://codeofpaper.com/paper/2411.11364)

Discussion