arXiv:2502.06491cs.LGcs.AI2025-02

提出RT算法,通过可靠性评估生成更可信的强化学习轨迹。

Model-Based Offline Reinforcement Learning with Reliability-Guaranteed Sequence Modeling

  • 用加权变分距离计算轨迹累积可靠性,剔除不可靠路径。
  • 结合高回报动作采样,从离线数据高效生成高收益轨迹。
  • 理论证明性能保障,实验证明优于当前主流方法。

基于模型的离线强化学习(MORL)旨在利用现有数据集构建的动力学模型学习策略。现有方法通常对动力学模型施加保守量化,并依赖当前状态和动作信息生成近似真实数据分布的轨迹,但忽略了历史信息对环境动态的影响,导致生成的轨迹不可靠,可能偏离真实数据分布。本文提出一种新算法——可靠性保障变换器(RT),通过计算生成轨迹的累积可靠性(即使用加权变分距离衡量与真实数据分布的偏离程度),有效消除不可靠轨迹。同时,通过采样高回报候选动作,RT能高效从现有离线数据中生成高回报轨迹。我们理论上证明了RT在策略学习中的性能保证,并在多个基准任务上实证其优于当前最先进的模型基方法。

原文摘要 · Abstract (English)

Model-based offline reinforcement learning (MORL) aims to learn a policy by exploiting a dynamics model derived from an existing dataset. Applying conservative quantification to the dynamics model, most existing works on MORL generate trajectories that approximate the real data distribution to facilitate policy learning by using current information (e.g., the state and action at time step $t$). However, these works neglect the impact of historical information on environmental dynamics, leading to the generation of unreliable trajectories that may not align with the real data distribution. In this paper, we propose a new MORL algorithm \textbf{R}eliability-guaranteed \textbf{T}ransformer (RT), which can eliminate unreliable trajectories by calculating the cumulative reliability of the generated trajectory (i.e., using a weighted variational distance away from the real data). Moreover, by sampling candidate actions with high rewards, RT can efficiently generate high-return trajectories from the existing offline data. We theoretically prove the performance guarantees of RT in policy learning, and empirically demonstrate its effectiveness against state-of-the-art model-based methods on several benchmark tasks.

强化学习离线学习可靠性轨迹生成

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