arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.01034cs.AIcs.CL
收藏

在多步骤LLM推理中发现过程-结果信用

Stepwise Intrinsic Rewards for Reasoning in Large Language Models

The University of Melbourne(墨尔本大学)

Xiangwei Wang, Wei Wang, Ken Chen, Nanduni Nimalsiri, Sachith Seneviratne, Saman Halgamuge

AI总结:

本文提出了一种新的框架,通过分步边际信息增益机制和解耦掩码策略,提升多步骤LLM推理的样本效率和准确性,并增强模型的分布外鲁棒性。

摘要:

强化学习(RL)作为一种增强大型语言模型(LLMs)推理能力的有力范式,然而标准的结果导向方法常常面临奖励稀疏性和信用分配效率低下的问题。在本文中,我们提出了一种新的框架,旨在提供连续的奖励信号,其中引入了分步边际信息增益(MIG)机制,该机制通过单调历史水印量化推理步骤的内在价值,有效过滤出训练噪声。为了确保解耦的信用分配,我们实现了解耦掩码策略,将过程导向的奖励专门应用于思维链(CoT)和结果导向的奖励应用于完整完成。此外,我们还纳入了双门控SFT目标以利用高质量的结构和事实信号稳定训练。在文本和多模态基准(如MATH、Super-CLEVR)上的广泛实验表明,我们的方法在样本效率和最终准确性方面均优于基线方法,如GRPO。此外,我们的模型表现出更强的分布外鲁棒性,展示了对未见和具有挑战性的推理任务的有希望的零样本迁移能力。

英文摘要:

Reinforcement learning (RL) has become a widely used paradigm for improving the reasoning abilities of large language models (LLMs) and Vision-language models (VLMs). Sparse binary outcome rewards, however, score only final correctness and cannot identify which intermediate steps contributed to it; in multimodal tasks, they may also reward answers driven by linguistic priors rather than visual evidence. Process reward models (PRMs) densify supervision but usually require process annotations, auxiliary models, or inference-time search. In this paper, we introduce Stepwise Marginal Information Gain (MIG), an intrinsic process reward computed from the policy itself. MIG measures how each structured reasoning prefix changes the length-normalized, teacher-forced log-likelihood of the reference answer. A monotonic historical watermark rewards only new likelihood maxima, avoiding duplicate credit after sub-record detours. We combine this signal with outcome and format rewards and a gated self-distillation objective that retains only structurally valid and correct trajectories. For VLMs, a real-versus-blank likelihood gate down-weights rewards when answers remain predictable without the image. Across eight task-specific benchmarks, the full method exceeds outcome-only GRPO in every single-run comparison. In broad-data transfer, it improves average accuracy by up to 4.8 points over binary-reward training and gains 12.6 points on MathVerse. At 7B, it exceeds an external PRM-BoN@16 baseline by 12.9 points on vision-language transfer without inference-time reranking. These results support policy-derived stepwise credit as an annotation-free alternative to explicit process reward modeling.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑