arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.04472cs.LGcs.AI
收藏

DAST: 为大推理模型引入难度自适应的慢思考

DAST: Difficulty-Adaptive Slow-Thinking for Large Reasoning Models

Unicom Data Intelligence(中国unicom数据智能);Data Science & Artificial Intelligence Research Institute(数据科学与人工智能研究院)

Yi Shen, Jian Zhang, Jieyun Huang, Shuming Shi, Wenjing Zhang, Jiangze Yan, Ning Wang, Kai Wang, Zhaoxiang Liu, Shiguo Lian

AI总结:

DAST通过自适应调整推理步骤长度,有效减少大模型的过度思考问题,同时保持复杂任务的推理准确性。

摘要:

最近在慢思考推理模型中的进展在复杂推理任务中表现出色。然而,这些模型常常表现出过度思考(为简单问题生成冗余的推理步骤),导致计算资源使用过多。尽管当前的缓解策略普遍减少推理标记,但它们可能会降低对需要扩展推理的任务性能的影响。本文介绍了一种名为难度自适应慢思考(DAST)的新框架,使模型能够根据问题难度自动调整链式思考(CoT)的长度。我们首先提出了一个标记长度预算(TLB)指标来量化难度,然后利用预算感知的奖励塑造和预算偏好优化来实现DAST。DAST对简单任务惩罚过长的响应,同时激励复杂问题的充分推理。在多样化的数据集和模型规模上的实验表明,DAST有效缓解了过度思考(平均减少标记使用超过30%),同时在复杂问题上保持推理准确性。我们的代码和模型可在https://github.com/AnonymousUser0520/AnonymousRepo01上获得。

英文摘要:

Recent advancements in slow thinking reasoning models have shown exceptional performance in complex reasoning tasks. However, these models often exhibit overthinking (generating redundant reasoning steps for simple problems), leading to excessive computational resource usage. While current mitigation strategies uniformly reduce reasoning tokens, they risk degrading performance on challenging tasks that require extended reasoning. This paper introduces Difficulty-Adaptive Slow Thinking (DAST), a novel framework that enables models to autonomously adjust the length of Chain-of-Thought (CoT) based on problem difficulty. We first propose a Token Length Budget (TLB) metric to quantify difficulty, then leverage budget-aware reward shaping and budget preference optimization to implement DAST. DAST penalizes overlong responses for simple tasks while incentivizing sufficient reasoning for complex problems. Experiments on diverse datasets and model scales demonstrate that DAST effectively mitigates overthinking (reducing token usage by over 30\% on average) while preserving reasoning accuracy on complex problems. Our codes and models are available at https://github.com/AnonymousUser0520/AnonymousRepo01.

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

↑