arXiv:2411.10809cs.LG2024-11被引 8

用扩散模型复现历史任务轨迹,缓解持续强化学习中的遗忘问题。

Stable Continual Reinforcement Learning via Diffusion-based Trajectory Replay

  • 用扩散模型生成高回报轨迹,动态记忆过往任务经验。
  • 在连续世界基准上平均成功率超越现有方法,稳定与适应性平衡更好。
  • 仅重播关键任务轨迹,节省计算资源,适合复杂多任务场景。

由于现实应用中普遍存在非平稳性,持续强化学习(Continual RL)旨在使智能体具备应对一系列顺序出现决策任务的能力。在此设定下,核心挑战是灾难性遗忘——学习新任务时容易丢失对旧任务的决策知识。近年来,生成回放方法通过生成模型重现过往任务的数据分布,展现出巨大潜力:相比直接存储数据,可减少存储开销并规避隐私风险。然而,受限于生成模型的表达能力,现有方法在处理大量任务或高维数据时难以准确重建过去任务的分布。受扩散模型在各类生成任务中成功启发,本文提出一种新算法 DISTR(基于扩散的轨迹回放),利用扩散模型记忆每个已遇任务的高回报轨迹分布,并在学习新任务时唤醒这些分布。此外,考虑到每次回放所有历史数据不切实际,本文设计优先级机制,选择性回放关键任务轨迹。在主流持续强化学习基准数据集 Continual World 上的实验表明,所提方法在稳定性与可塑性之间取得良好平衡,平均成功率显著优于多种现有基线方法。

原文摘要 · Abstract (English)

Given the inherent non-stationarity prevalent in real-world applications, continual Reinforcement Learning (RL) aims to equip the agent with the capability to address a series of sequentially presented decision-making tasks. Within this problem setting, a pivotal challenge revolves around \textit{catastrophic forgetting} issue, wherein the agent is prone to effortlessly erode the decisional knowledge associated with past encountered tasks when learning the new one. In recent progresses, the \textit{generative replay} methods have showcased substantial potential by employing generative models to replay data distribution of past tasks. Compared to storing the data from past tasks directly, this category of methods circumvents the growing storage overhead and possible data privacy concerns. However, constrained by the expressive capacity of generative models, existing \textit{generative replay} methods face challenges in faithfully reconstructing the data distribution of past tasks, particularly in scenarios with a myriad of tasks or high-dimensional data. Inspired by the success of diffusion models in various generative tasks, this paper introduces a novel continual RL algorithm DISTR (Diffusion-based Trajectory Replay) that employs a diffusion model to memorize the high-return trajectory distribution of each encountered task and wakeups these distributions during the policy learning on new tasks. Besides, considering the impracticality of replaying all past data each time, a prioritization mechanism is proposed to prioritize the trajectory replay of pivotal tasks in our method. Empirical experiments on the popular continual RL benchmark \texttt{Continual World} demonstrate that our proposed method obtains a favorable balance between \textit{stability} and \textit{plasticity}, surpassing various existing continual RL baselines in average success rate.

持续强化学习扩散模型轨迹回放灾难性遗忘

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。