通过拆分合并优化,让大模型推理更高效且不丢能力。
Short Chains, Deep Thoughts: Balancing Reasoning Efficiency and Intra-Segment Capability via Split-Merge Optimization
- 用动态拆分合并算法消除推理链冗余。
- 准确率提升3.3点,段落数减少28.7%。
- 适合追求推理效率的AI系统开发者。
大型推理模型(LRMs)虽能通过生成长推理链解决复杂任务,但冗长输出带来显著延迟与计算开销。为此,我们提出CoSMo(一致性引导的拆分-合并优化)框架,旨在消除结构冗余而非简单限制生成长度。CoSMo采用动态拆分-合并算法,通过合并重复段落、拆分逻辑断层来优化推理链,确保连贯性。同时,引入基于段落级别的预算机制,结合结构对齐强化学习,在训练中持续指导模型保持高效推理结构。在多个基准测试和模型骨干上进行的广泛实验表明,CoSMo相比推理效率基线,平均准确率提升3.3点,段落数减少28.7%。
原文摘要 · Abstract (English)
While Large Reasoning Models (LRMs) have demonstrated impressive capabilities in solving complex tasks through the generation of long reasoning chains, this reliance on verbose generation results in significant latency and computational overhead. To address these challenges, we propose \textbf{CoSMo} (\textbf{Co}nsistency-Guided \textbf{S}plit-\textbf{M}erge \textbf{O}ptimization), a framework designed to eliminate structural redundancy rather than indiscriminately restricting token volume. Specifically, CoSMo utilizes a split-merge algorithm that dynamically refines reasoning chains by merging redundant segments and splitting logical gaps to ensure coherence. We then employ structure-aligned reinforcement learning with a novel segment-level budget to supervise the model in maintaining efficient reasoning structures throughout training. Extensive experiments across multiple benchmarks and backbones demonstrate that CoSMo achieves superior performance, improving accuracy by \textbf{3.3} points while reducing segment usage by \textbf{28.7\%} on average compared to reasoning efficiency baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。