arXiv cs.AI· Yi Wen, Hao Chen, Wanyu Wang, Maolin Wang, Pengyue Jia, Derong Xu, Huize Tan, Yingyi Zhang, Wenlin Zhang, Weihong Luo, Xiku Du, Xiangyu Zhao·· 12 小时前AI 评分32
TrajEvolve:带事后信用分配的轨迹进化强化学习
TrajEvolve: Trajectory Evolution for Reinforcement Learning with Hindsight Credit Assignment
AI 导读
TrajEvolve 提出一种轨迹进化范式,通过精炼历史轨迹中的低质量步骤生成“进化轨迹”,让策略接触到基础模型能力范围内但训练预算内难以采样的高质量组合。该方法将步骤级连续信用分配重构为二分类任务,借助反事实验证识别冗余步骤。两个数据集上的实验验证了其有效性,论文已被 NeurIPS 2026 接收。
正文 · 原文
Authors:Yi Wen, Hao Chen, Wanyu Wang, Maolin Wang, Pengyue Jia, Derong Xu, Huize Tan, Yingyi Zhang, Wenlin Zhang, Weihong Luo, Xiku Du, Xiangyu Zhao
Abstract:The Reinforcement Learning (RL) paradigm has achieved remarkable success in enhancing the reasoning capabilities of Large Language Models (LLMs). However, when applied to long-horizon tasks, it faces severe challenges: i) Due to the high task complexity, the model struggles to sample enough successful trajectories, resulting in slow convergence. ii) Relying solely on sparse final rewards causes all steps to be updated indiscriminately, encouraging redundant step generation. When both the quantity and quality of successful trajectories become difficult to guarantee, the performance is severely constrained. This dilemma stems from the limitations: existing RL paradigms rely entirely on the reasoning capability of base models, lacking the ability to actively optimize trajectories. To address the above issues, we propose a novel trajectory evolution paradigm with hindsight credit assignment, termed TrajEvolve. TrajEvolve not only relies on the trajectory inferred by the model but also generates ``evolutionary trajectories'' by refining low-quality steps in historical trajectories, thereby exposing the policy to high-quality compositions that lie within the base model's support but are rarely sampled within practical training budgets. Furthermore, TrajEvolve reformulates step-level continuous credit assignment as a binary classification task, whether each step is necessary for task completion. This simplification not only reduces the learning difficulty but also enables step labels to be obtained through counterfactual verification, achieving precise identification of redundant steps. Extensive experiments on two datasets demonstrate the superiority of the proposed method.
| Comments: | NeurIPS 2026 accepted paper |
| Subjects: | Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2610.28060 [cs.AI] |
| (or arXiv:2610.28060v1 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2610.28060 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Yi Wen [view email]
[v1]
Tue, 20 Oct 2026 11:48:01 UTC (711 KB)
来源:arXiv cs.AI · arxiv.org