通过语义与词元熵提升大模型推理的强化学习方法
Efficient Reinforcement Learning with Semantic and Token Entropy for LLM Reasoning
- 用语义熵引导课程学习,由易到难组织训练数据
- 对低熵词元施加KL正则,缓解策略探索下降问题
- 在6个基准上优于现有熵相关方法,适配多规模模型
基于可验证奖励的强化学习(RLVR)在提升大语言模型(LLM)推理能力方面表现优异。然而,这种以准确率为导向的学习范式常遭遇熵崩溃问题,导致策略探索能力下降,限制了推理性能。为此,我们提出一种高效的强化学习框架,同时利用语义与词元层面的熵信号来改善推理。从数据角度,引入语义熵引导的课程学习,按语义熵从低到高组织训练数据,实现从简单到复杂任务的渐进优化。在算法设计上,采用非均匀词元处理机制:对影响策略探索的关键低熵词元施加KL正则,对高协方差部分施加更强约束。通过联合优化数据组织与算法设计,有效缓解熵崩溃,显著提升LLM推理能力。在3种不同参数规模的基模型上,于6个基准上的实验结果表明,本方法在改进推理方面优于其他基于熵的方法。
原文摘要 · Abstract (English)
Reinforcement learning with verifiable rewards (RLVR) has demonstrated superior performance in enhancing the reasoning capability of large language models (LLMs). However, this accuracy-oriented learning paradigm often suffers from entropy collapse, which reduces policy exploration and limits reasoning capabilities. To address this challenge, we propose an efficient reinforcement learning framework that leverages entropy signals at both the semantic and token levels to improve reasoning. From the data perspective, we introduce semantic entropy-guided curriculum learning, organizing training data from low to high semantic entropy to guide progressive optimization from easier to more challenging tasks. For the algorithmic design, we adopt non-uniform token treatment by imposing KL regularization on low-entropy tokens that critically impact policy exploration and applying stronger constraints on high-covariance portions within these tokens. By jointly optimizing data organization and algorithmic design, our method effectively mitigates entropy collapse and enhances LLM reasoning. Experimental results across 6 benchmarks with 3 different parameter-scale base models demonstrate that our method outperforms other entropy-based approaches in improving reasoning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。