arXiv Computation and Language

ReCal: Calibrating Structured Pruning for On-Policy Distillation Recovery

ReCal introduces a Recovery‑Aware Calibration method that adjusts calibration statistics before structured pruning to preserve teacher‑supported predictions. By using forward KL divergence between an unpruned teacher and a pruned probe, ReCal reweights pruning criteria to reduce damage that persists after offline distillation. Experiments show that ReCal consistently improves mathematical reasoning performance after on‑policy distillation, achieving up to 16.7 percentage‑point gains on AIME and better code‑generation results across multiple models and pruning methods.

arXiv Machine Learning
Oct 8

TAP: Efficient Long-Horizon Agent Pruning via Trajectory-Anchored Recovery

TAP (Trajectory‑Anchored Pruning) is a structural pruning framework designed for reinforcement‑learning‑trained agents that addresses the shortcomings of existing pruning methods on long‑horizon tasks. It couples iterative channel pruning with on‑policy recovery, anchoring student interactions to teacher trajectories and re‑scoring channels using gradients from the recovery objective. Experiments show that removing 60% of FFN channels preserves 99.2% and 88.0% of task success rates on ALFWorld and WebShop while cutting GPU time per successful task by about 22% and 17%.

By Yuanzhe Li, Pengxin Wang, Yuxin Ren, Jianing Deng, Jingtong Hu, Song Wang, Jingdi Chen, Huanrui Yang
arXiv AI
Sep 17

OBC-Prune: Outcome-Based Calibration for Large Reasoning Model Pruning

OBC‑Prune introduces an outcome‑based calibration approach for pruning large reasoning models, focusing on the causal importance of each reasoning sentence rather than uniform activation salience. By pairing correct and incorrect rollouts and using intervention‑based analysis, it assigns per‑token weights that guide one‑shot pruning methods such as SparseGPT, Wanda, and ALPS. Experiments on DeepSeek‑R1‑Distill‑Qwen models show consistent accuracy gains and shorter reasoning traces across multiple benchmarks at 40‑50% sparsity.

By Ha Lan Nguyen, Huy Hoang Tran, Trac-Duy Tran, Dung D. Le
arXiv AI
Jun 30

Beyond Scaling Law: A Data-Efficient Distillation Framework for Reasoning

arXiv:2508. 09883v2 Announce Type: replace-cross Abstract: Large language models (LLMs) demonstrate remarkable reasoning capabilities in tasks such as algorithmic coding and mathematical problem-solving.

By Xiaojun Wu, Xiaoguang Jiang, Huiyang Li, Jucai Zhai, Dengfeng Liu, Qiaobo Hao, Huang Liu, Zhiguo Yang, Ji Xie, Ninglun Gu, Jin Yang, Kailai Zhang, Yelun Bao, Jun Wang
arXiv AI
Sep 17

Trajectory Learnability for Offline On-Policy Distillation with Imperfect Teachers

The paper introduces a method for offline on‑policy distillation that addresses the problem of imperfect teacher supervision. By training on teacher‑successful problems and measuring changes in token likelihoods on teacher‑failed trajectories, the authors derive a learnability signal that weights the distillation loss. This approach improves performance on mathematical reasoning and code generation tasks while reducing computational cost compared to online distillation.

By Yihao Ai, Weilong Yan
arXiv Computation and Language
Sep 2

When Compression Helps and When It Hurts: Condition-Aware Analysis of Chain-of-Thought Distillation

The paper studies how to compress Chain-of-Thought (CoT) reasoning traces for smaller models. It examines three compression dimensions—importance criterion, restructuring level, and compression budget—across Math and General domains and Long/Short CoT regimes. Findings show that step-level pruning works best for shared reasoning backbones, token-level pruning needs symbol-aware signals, domain-specific restructuring effects differ, and training-time compression may not reduce inference cost, especially for Long-CoT students.

By Siyang Lyu, Xinghao Chen, Zhijing Sun, Tong Liu, Dawei Zhu, Xiaoyu Shen
arXiv AI
Aug 25

Revisiting the Effectiveness of LLM Pruning for Test-Time Scaling

The paper revisits the impact of pruning on large language models (LLMs) during test-time scaling (TTS). While prior work found that structured pruning degrades reasoning performance, this study shows that unstructured pruning—removing only specific redundant weights—can actually improve TTS performance on reasoning benchmarks for models s1.1-7B and Qwen3-8B, sometimes surpassing the full-weight models. The authors also examine how different layer-wise sparsity allocation strategies affect these outcomes.

By Ocean Monjur, Shahriar Kabir Nahin, Anshuman Chhabra