Reasoning Compression with Mixed-Policy Distillation
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Reasoning-centric large language models (LLMs) achieve strong performance by generating intermediate reasoning trajectories, but often incur excessive token usage and high inference-time decoding cost. We observe that, when solving the same problems, larger reasoning models can often produce more concise traces, whereas smaller reasoning models tend to generate longer and more redundant trajectories. This is especially problematic in real-world deployment, where memory, latency, and serving-cost constraints often favor smaller models. Our observations suggest that reasoning compression can be transferred from large models to small ones rather than enforced through explicit length constraints. Based on this insight, we propose Mixed-Policy Distillation (MPD), a reasoning compression framework that transfers concise reasoning behavior from a larger-sized teacher to a smaller student by distilling teacher-compressed student trajectories. Unlike on-policy distillation, which aligns the student with teacher distributions over verbose student trajectories, or off-policy distillation, which relies on teacher-generated trajectories and may suffer from distribution mismatch, MPD combines the strengths of both. Given a student-sampled trajectory, the teacher rewrites it into a more concise reasoning trace, and the student is trained via KL-based alignment on the compressed trajectory. This preserves student-policy exploration while injecting teacher-guided compression. Experiments on Qwen3-1.7B show that MPD reduces token usage by up to 27.1% while improving performance across multiple reasoning benchmarks, demonstrating an effective approach to efficient small-model reasoning.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 16 of its 37 references that are in the map. First posted on arXiv 9 May 2026.
Builds on
16 of 37 references.
Closest ancestors · 3
Same direction, newest first
- 2025L1: Controlling How Long A Reasoning Model Thinks With Reinforcement Learning6 Mar
- 2025How Well do LLMs Compress Their Own Chain-of-Thought? A Token Complexity Approach3 Mar
- 2024Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs30 Dec
Other references · 13
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2025Qwen3 Technical Reportcited by 8,195
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 2024OpenAI o1 System Cardcited by 1,220
- 2026Self-Distilled Reasoner: On-Policy Self-Distillation for Large Language Modelscited by 386
- 2025Chain of Draft: Thinking Faster by Writing Lesscited by 290
- 2026On-Policy Context Distillation for Language Modelscited by 161
- 2026CRISP: Compressed Reasoning via Iterative Self-Policy Distillationcited by 49
- 2025Concise Reasoning, Big Gains: Pruning Long Reasoning Trace with Difficulty-Aware Promptingcited by 13
- 2026Thinking to Recall: How Reasoning Unlocks Parametric Knowledge in LLMscited by 13
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2026Compress-Distill: Reasoning Trace Compression for Efficient Knowledge Distillation
- 2025Beyond Scaling Law: A Data-Efficient Distillation Framework for Reasoning
- 2025Optimizing Length Compression in Large Reasoning Models
- 2025ConCISE: Confidence-guided Compression in Step-by-step Efficient Reasoning
- 2025Breadcrumbs Reasoning: Memory-Efficient Reasoning with Compression Beacons
- 2026Shorthand for Thought: Compressing LLM Reasoning via Entropy-Guided Supertokens
- 2025TwT: Thinking without Tokens by Habitual Reasoning Distillation with Multi-Teachers' Guidance
- 2026PACE: Prefix-Protected and Difficulty-Aware Compression for Efficient Reasoning