Jintian Zhang, Yuqi Zhu, Mengshu Sun, Yujie Luo, Shuofei Qiao, Lun Du, Da Zheng, Huajun Chen, Ningyu Zhang
| Challenge: | Recent advances in Large Language Models have demonstrated their remarkable capabilities in complex reasoning tasks, but their efficiency is hindered by the substantial memory and computational costs associated with generating lengthy tokens. |
| Approach: | They propose a method that dynamically compresses verbose thought steps into compact representations and discards original reasoning chains. |
| Outcome: | The proposed method reduces peak memory usage and inference time while maintaining competitive accuracy. |
Similar Papers
TokenSkip: Controllable Chain-of-Thought Compression in LLMs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) has been proven effective in enhancing the reasoning capabilities of large language models (LLMs). |
| Approach: | They propose a chain-of-thought (CoT) prompting approach that enables LLMs to selectively skip less important tokens, allowing for controllable CoT compression. |
| Outcome: | Experiments show that TokenSkip reduces CoT token usage while preserving strong reasoning performance. |
Can Reasoning Path still be Effective as Input? Bridging Post-Reasoning to Chain-of-Thought Compression (2026.acl-long)
Copied to clipboard
Chengzhengxu Li, Xiaoming Liu, Zhaohan Zhang, Shengchao Liu, Guoxin Ma, Yu Lan, Cong Wang, Chao Shen
| Challenge: | Existing work on reducing CoT generation in reasoning impairs the necessary information for deriving the correct answer. |
| Approach: | They propose a reasoning paradigm that takes CoT as a part of context to simplify the reasoning task for Large Language Models (LLMs). |
| Outcome: | The proposed framework reduces the generation length of LLMs, but its effectiveness hinges on the efficiency and reliability of the contextual CoT generation. |
Token-Budget-Aware LLM Reasoning (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to enhance reasoning capabilities of large language models incur significant overhead in token usage, leading to increased costs. |
| Approach: | They propose a token-budget-aware LLM reasoning framework that adjusts the number of reasoning tokens based on the reasoning complexity of each problem. |
| Outcome: | The proposed method reduces token costs in CoT reasoning with only a slight performance reduction. |
ConCISE: Confidence-guided Compression in Step-by-step Efficient Reasoning (2025.emnlp-main)
Copied to clipboard
Ziqing Qiao, Yongheng Deng, Jiali Zeng, Dong Wang, Lai Wei, Guanbo Wang, Fandong Meng, Jie Zhou, Ju Ren, Yaoxue Zhang
| Challenge: | Existing methods for fine-tuning-based compression suffer from verbose outputs, increasing computational overhead. |
| Approach: | They propose a framework to generate concise reasoning chains using Confidence Injection and Early Stopping. |
| Outcome: | The proposed framework reduces the length of the model by up to 50% while maintaining high task accuracy. |
Think Less, Know More: State-Aware Reasoning Compression with Knowledge Guidance for Efficient Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing CoT compression methods struggle to balance accuracy and efficiency . long CoT reasoning also introduces an overthinking phenomenon, authors say . |
| Approach: | They propose a framework that performs step-wise CoT compression by modeling stage-specific redundancy sources and integrating with a retrieval-augmented guidance. |
| Outcome: | The proposed framework reduces average response length by 59.9% while improving accuracy by 4.8 points over existing methods. |
Beyond Token Length: Step Pruner for Efficient and Accurate Reasoning in Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reinforcement learning methods for large reasoning models suffer from excessive verbosity, known as "overthinking." Existing models penalize generated tokens to promote conciseness, but these methods encounter two challenges: they may develop hacking behavior in later stages of training by discarding reasoning steps. |
| Approach: | They propose a framework that steers large reasoning models toward more efficient reasoning . they prioritize correctness while imposing penalties for redundant steps . |
| Outcome: | The proposed framework reduces token usage by 69.7% on AIME24. |
Masked Thought: Simply Masking Partial Reasoning Steps Can Improve Mathematical Reasoning Learning of Language Models (2024.acl-long)
Copied to clipboard
Changyu Chen, Xiting Wang, Ting-En Lin, Ang Lv, Yuchuan Wu, Xin Gao, Ji-Rong Wen, Rui Yan, Yongbin Li
| Challenge: | Despite the advances in large language models, they still face difficulties with multi-step reasoning tasks. |
| Approach: | They propose a method that randomly masks certain tokens within the chain of thought to improve model accuracy by 5% over standard supervised fine-tuning. |
| Outcome: | The proposed method improves accuracy and accuracy by 5% over standard fine-tuning with a few codes modified. |
Think Faster Than Words: Efficient LLM Chain-of-Thought Reasoning via Dynamic Shortcut Decoding (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods that prune or employ early stopping to reduce latency often compromise reasoning reliability. |
| Approach: | They propose a shortcut decoding framework that integrates probes over internal hidden states with step-level entropy to detect convergence of reasoning during generation and adaptively selects between a fast-exit path and a stability-verified path to remove redundant steps while preserving answer correctness. |
| Outcome: | The proposed framework reduces token usage by approximately 35% and maintains accuracy comparable to full CoT decoding. |
Optimizing Length Compression in Large Reasoning Models (2026.acl-long)
Copied to clipboard
| Challenge: | Large Reasoning Models suffer from producing unnecessary and verbose reasoning chains. |
| Approach: | They propose a post-training method that uses a Length Reward and a Compress Reward to remove the invalid portion of the thinking process. |
| Outcome: | The proposed method reduces sequence length by 50% with only a marginal (2%) drop in accuracy. |
Correct, Concise and Complete: Multi-stage Training For Adaptive Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) increase test-time computation, often in the form of chain-of-thought (CoT) however, reasoning traces can become unnecessarily long, increasing computation costs without improving accuracy and sometimes even degrading performance. |
| Approach: | They propose a multi-stage efficient reasoning method that combines supervised fine-tuning with reinforcement learning using an adaptive length penalty. |
| Outcome: | The proposed method reduces response length by an average of 28% for 8B models and 40% for 32B models while incurring only minor performance drops of 1.6 and 2.5 points, respectively. |