mlsanityData to 14 Oct 2026

CRISP: Compressing Redundancy in Chain-of-Thought via Intrinsic Saliency Pruning

arXiv 2604.17297 ↗First posted 19 Apr 2026cs.CLcited by 1

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Long Chain-of-Thought (CoT) reasoning is pivotal for the success of recent reasoning models but suffers from high computational overhead and latency. While prior works attempt to compress CoT via external compressor, they often fail to align with the model's internal reasoning dynamics, resulting in the loss of critical logical steps. This paper presents Compressing Redundancy in Chain-of-Thought via Intrinsic Saliency Pruning (CRISP), a framework that compresses CoT by exploiting the model's intrinsic saliency. Our analysis reveals a distinct phenomenon: the reasoning termination token texttt[object Object] acts as an information anchor, where its attention pattern effectively demarcates essential reasoning from redundancy. Based on this finding, we design a policy that utilizes these intrinsic attention signals to guide atomic compression operations. In contrast to coarse-grained pruning strategies, CRISP strategically distills the reasoning chain to maximize information density while preserving logical coherence. Empirical results across various backbone models and mathematical datasets demonstrate that CRISP achieves a 50-60% reduction in token count without compromising accuracy, effectively mitigating the efficiency bottleneck of long-context reasoning. We open-source our implementation to facilitate further research in efficient reasoning.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 26 of its 41 references that are in the map. First posted on arXiv 19 Apr 2026.

Builds on

26 of 41 references.

Closest ancestors · 9

Same direction, newest first

  1. 2025Think Clearly: Improving Reasoning via Redundant Token Pruning17 Jun
  2. 2025A*-Thought: Efficient Reasoning via Bidirectional Compression for Low-Resource Settings30 May
  3. 2025R1-Compress: Long Chain-of-Thought Compression via Chunk Compression and Search22 May
  4. 2025ThinkLess: A Training-Free Inference-Efficient Method for Reducing Reasoning Redundancy21 May
  5. 2025Efficient Reasoning Models: A Survey15 Apr
  6. 2025Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models20 Mar
  7. 2025L1: Controlling How Long A Reasoning Model Thinks With Reinforcement Learning6 Mar
  8. 2025TokenSkip: Controllable Chain-of-Thought Compression in LLMs17 Feb
  9. 2025O1-Pruner: Length-Harmonizing Fine-Tuning for O1-Like Reasoning Pruning22 Jan

Other references · 17

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  3. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  4. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
  5. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
  6. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
  7. 2024LlamaFactory: Unified Efficient Fine-Tuning of 100+ Language Modelscited by 1,464
  8. 2022Least-to-Most Prompting Enables Complex Reasoning in Large Language Modelscited by 1,407
  9. 2024OpenAI o1 System Cardcited by 1,244
  10. 2022Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Taskscited by 1,076
  11. 2025Group Sequence Policy Optimizationcited by 835
  12. 2024DeepSeek-V3 Technical Reportcited by 811
5 more
  1. 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compressioncited by 348
  2. 2025Chain of Draft: Thinking Faster by Writing Lesscited by 297
  3. 2023Label Words are Anchors: An Information Flow Perspective for Understanding In-Context Learningcited by 236
  4. 2025Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Modelscited by 51
  5. 2024Over-Reasoning and Redundant Calculation of Large Language Modelscited by 27

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models
  2. 2026Chain Of Thought Compression: A Theoretical Analysis
  3. 2026CtrlCoT: Dual-Granularity Chain-of-Thought Compression for Controllable Reasoning
  4. 2026HybridThinker: Efficient Chain-of-Thought Reasoning via Compressed Memory and Transient Thought Steps
  5. 2026Every Token Leaves a Ripple in the Stream of Thought: Eliciting Model-Internal Token Saliency for Chain-of-Thought Compression
  6. 2025Making Slow Thinking Faster: Compressing LLM Chain-of-Thought via Step Entropy
  7. 2026When Compression Helps and When It Hurts: Condition-Aware Analysis of Chain-of-Thought Distillation
  8. 2025Efficient Reasoning with Hidden Thinking