arXiv cs.CL· Yijun Zhu, Jianxin Wang, Chengchao Shen·· 11 小时前AI 评分31
FPRT:面向推理蒸馏的失败画像与可达轨迹选择方法
Failure Profiling and Reachable Trajectory Selection for Reasoning Distillation
AI 导读
研究者提出 FPRT(Failure Profiling and Reachable Trajectory Selection)方法,通过重复采样刻画学生模型的错误率与错误一致性以区分失败模式,再按模式定制提示策略生成教师候选,并优先选择分歧点后初始推理步骤最易被学生复现的轨迹。
正文 · 原文
Abstract:Training smaller language models on reasoning solutions generated by a larger teacher model is the prevailing approach for transferring mathematical reasoning capabilities. However, the student tends to overfit the output distribution of the teacher and generalizes poorly when its own behavior at inference time deviates from the training data. Recent methods attempt to bridge this gap by incorporating error data, yet the corrective trajectories still reflect the reasoning patterns of the teacher, which the student cannot reliably reproduce, leaving the distribution mismatch largely unresolved. We propose a method, Failure Profiling and Reachable Trajectory Selection (FPRT), built on the insight that effective training data should be jointly determined by what the student fails on and what it can realistically learn. Our method first profiles the failure behavior of the student on each problem through repeated sampling, characterizing it in terms of error rate and error consistency to reveal qualitatively distinct failure modes. Each mode demands a fundamentally different training signal. The diagnosed mode then guides candidate generation from the teacher via distinct prompting strategies tailored to each failure type. Among the correct candidates, our method selects the one whose initial reasoning steps after the point of divergence are most reproducible by the student. These first corrective steps constitute the primary bottleneck, while the remaining steps follow an already corrected context and can therefore be continued more readily. This contrasts with standard reranking approaches, which score the trajectory as a whole and thereby dilute the signal at the critical reasoning transition. Experiments demonstrate that our method achieves the SOTA performance across the five benchmarks on both student backbones.
| Comments: | Accepted to NeurIPS 2026. The source code and trained weights are available at \url{this https URL} |
| Subjects: | Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) |
| Cite as: | arXiv:2611.09042 [cs.CL] |
| (or arXiv:2611.09042v1 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2611.09042 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Chengchao Shen [view email]
[v1]
Fri, 6 Nov 2026 06:14:20 UTC (864 KB)
来源:arXiv cs.CL · arxiv.org