用模型自身反馈训练,让AI更高效地从错误中学习。
Reinforcement Learning via Self-Distillation
- 将文本反馈转化为密集学习信号,无需外部老师
- 在多个任务上提升样本效率和最终准确率
- 适合需要快速试错的复杂推理场景
大型语言模型在可验证领域(如代码和数学)中越来越多地通过强化学习进行后训练。然而,现有的可验证奖励强化学习(RLVR)方法仅基于每次尝试的标量结果奖励,导致严重的信用分配瓶颈。许多可验证环境实际上提供丰富的文本反馈,如运行时错误或评分评价,解释了失败原因。我们将其形式化为具有丰富反馈的强化学习,并提出自蒸馏策略优化(SDPO),将分词后的反馈转换为密集学习信号,无需外部教师或显式奖励模型。SDPO将当前模型在反馈条件下的下一步预测视为自教师,将其反馈引导的预测回传至策略中。通过这种方式,SDPO利用模型在上下文中回溯识别自身错误的能力。在LiveCodeBench v6上的科学推理、工具使用和竞赛编程任务中,SDPO相较于强基线提升了样本效率和最终准确率。值得注意的是,即使在仅返回标量反馈的标准RLVR环境中,SDPO也因使用成功轨迹作为失败尝试的隐含反馈而表现更优。最后,在测试时对单个问题应用SDPO,可在困难的二元奖励任务上加速发现,仅需3倍少的尝试即可达到最佳k次采样或多轮对话的发现概率。
原文摘要 · Abstract (English)
Large language models are increasingly post-trained with reinforcement learning in verifiable domains such as code and math. Yet, current methods for reinforcement learning with verifiable rewards (RLVR) learn only from a scalar outcome reward per attempt, creating a severe credit-assignment bottleneck. Many verifiable environments actually provide rich textual feedback, such as runtime errors or judge evaluations, that explain why an attempt failed. We formalize this setting as reinforcement learning with rich feedback and introduce Self-Distillation Policy Optimization (SDPO), which converts tokenized feedback into a dense learning signal without any external teacher or explicit reward model. SDPO treats the current model conditioned on feedback as a self-teacher and distills its feedback-informed next-token predictions back into the policy. In this way, SDPO leverages the model's ability to retrospectively identify its own mistakes in-context. Across scientific reasoning, tool use, and competitive programming on LiveCodeBench v6, SDPO improves sample efficiency and final accuracy over strong RLVR baselines. Notably, SDPO also outperforms baselines in standard RLVR environments that only return scalar feedback by using successful rollouts as implicit feedback for failed attempts. Finally, applying SDPO to individual questions at test time accelerates discovery on difficult binary-reward tasks, achieving the same discovery probability as best-of-k sampling or multi-turn conversations with 3x fewer attempts.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。