让大模型根据任务难易自动调节思考深度,避免无效冗长推理。
Mitigating Overthinking in Large Reasoning Models via Difficulty-aware Reinforcement Learning
- 基于难度感知的强化学习框架,让模型自主判断任务复杂度。
- 减少冗余思考token达40%以上,性能几乎无损。
- 无需人工标注,适合需要高效推理的部署场景。
大型推理模型(LRM)通过模仿人类深层思考行为实现显式思维链扩展,在复杂任务中表现优异。然而,在处理简单任务时,深度思考模式常导致推理过长和资源浪费。这种过度思考现象可能源于后训练阶段奖励函数引发的生成偏好。现有研究从提示设计或模型训练角度缓解该问题,但普遍低估了任务难度感知的重要性,难以有效分配推理资源。本文提出难度感知策略优化(DiPO),一种基于强化学习的LRM训练框架。DiPO促使模型自发建模任务复杂度,并将其融入强化学习框架以调整后训练引入的生成偏好。我们提出一种基于模型自我推理的难度建模方法,显著降低对人工标注的依赖,并形式化任务复杂度。进一步设计了包含长度惩罚的难度信号增强型奖励函数,同时兼顾推理性能与输出格式。实验表明,DiPO使模型能自发调整推理开销,在显著减少冗余token的同时,未因思维压缩而损失性能。
原文摘要 · Abstract (English)
Large Reasoning Models (LRMs) achieve explicit chain-of-thought expansion by imitating deep thinking behaviors of humans, demonstrating excellent performance in complex task scenarios. However, the deep-thinking mode often leads to unnecessarily lengthy reasoning and resource inefficiency when handling simple tasks. This overthinking phenomenon may arise from the generation preference triggered by the reward function during post-training. Existing research attempts to mitigate overthinking from the perspective of prompt design or model training, but generally underestimates the importance of task difficulty awareness, which makes it difficult for LRMs to effectively allocate reasoning resources. In this paper, we propose Difficulty-aware Policy Optimization (DiPO), a reinforcement learning-based LRM training framework. DiPO encourages LRM to spontaneously model task complexity, and integrates them into reinforcement learning framework to adjust the generation preferences introduced by post-training. A difficulty modeling method based on model self-reasoning is proposed, which significantly reduces the dependence on manual annotation and formalize task complexity. We further develop a difficulty-signal-enhanced reward function that incorporates a penalty for lengthy reasoning while considering reasoning performance and output format. Experimental results indicate that DiPO enables the model to spontaneously adjust inference overhead, significantly reducing redundant tokens without losing performance due to thought compression.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。