用少量数据融合监督与强化学习,提升大模型推理能力
Mitigating Forgetting Between Supervised and Reinforcement Learning Yields Stronger Reasoners
- 动态挑选难题样本用于监督微调,减少数据依赖
- 仅用1.5%监督数据和20.4%强化数据达顶尖推理表现
- 防止强化学习技能遗忘,适合推理后训练场景
大型语言模型(LLMs)具备强大推理能力,常通过思维链(CoT)提示和强化学习(RL)增强。尽管RL能显著提升推理,但其受限于自身推理轨迹,难以拓展知识边界。监督微调(SFT)虽有互补优势,却需大量数据且易过拟合。现有联合SFT与RL的方法面临数据低效、算法耦合和灾难性遗忘三大挑战。本文提出一种即插即用框架,通过动态选择高难度样本进行SFT,并在计算损失时聚焦高熵词元,同时冻结对RL至关重要的参数,有效缓解遗忘。该方法仅需1.5%的原始SFT数据和20.4%的原始RL数据,即可达到当前最优(SoTA)推理性能,为推理后训练提供高效、通用的融合方案。
原文摘要 · Abstract (English)
Large Language Models (LLMs) show strong reasoning abilities, often amplified by Chain-of-Thought (CoT) prompting and reinforcement learning (RL). Although RL algorithms can substantially improve reasoning, they struggle to expand reasoning boundaries because they learn from their own reasoning trajectories rather than acquiring external knowledge. Supervised fine-tuning (SFT) offers complementary benefits but typically requires large-scale data and risks overfitting. Recent attempts to combine SFT and RL face three main challenges: data inefficiency, algorithm-specific designs, and catastrophic forgetting. We propose a plug-and-play framework that dynamically integrates SFT into RL by selecting challenging examples for SFT. This approach reduces SFT data requirements and remains agnostic to the choice of RL or SFT algorithm. To mitigate catastrophic forgetting of RL-acquired skills during SFT, we select high-entropy tokens for loss calculation and freeze parameters identified as critical for RL. Our method achieves state-of-the-art (SoTA) reasoning performance using only 1.5% of the SFT data and 20.4% of the RL data used by prior SoTA, providing an efficient and plug-and-play solution for combining SFT and RL in reasoning post-training.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。