Reasoning Models Can be Accurately Pruned Via Chain-of-Thought Reconstruction

Ryan Lucas, Kayhan Behdin, Zhipeng Wang, Qingquan Song, Shao Tang +1 more
9/15/2025
cs.AI

Official code: RyanLucas3/RAC (2 stars, last commit 2026-03-30).

Abstract

Reasoning language models such as DeepSeek-R1 produce long chain-of-thought traces during inference time which make them costly to deploy at scale. We show that using compression techniques such as neural network pruning produces greater performance loss than in typical language modeling tasks, and in some cases can make the model slower since they cause the model to produce more thinking tokens but with worse performance. We show that this is partly due to the fact that standard LLM pruning methods often focus on input reconstruction, whereas reasoning is a decode-dominated task. We introduce a simple, drop-in fix: during pruning we jointly reconstruct activations from the input and the model's on-policy chain-of-thought traces. This "Reasoning-Aware Compression" (RAC) integrates seamlessly into existing pruning workflows such as SparseGPT, and boosts their performance significantly. Code reproducing the results in the paper can be found at: https://github.com/RyanLucas3/RAC

View on arXivView PDF

Code Implementations(1)

RyanLucas3/RACOfficial100%
23Shell, PythonSep 15, 20256 months ago

Cite this paper

@article{lucas2025reasoning,
  title  = {Reasoning Models Can be Accurately Pruned Via Chain-of-Thought Reconstruction},
  author = {Ryan Lucas and Kayhan Behdin and Zhipeng Wang and Qingquan Song and Shao Tang and Rahul Mazumder},
  year   = {2025},
  eprint = {2509.12464},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.12464v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.12464.svg)](https://codeofpaper.com/paper/2509.12464)

Discussion