Challenge: Chain-of-thought enables large reasoning models to reason through multi-step problems but often leads to unnecessarily long or redundant reasoning traces, a phenomenon known as overthinking.
Approach: They propose an inference-time framework that selectively prunes low-utility reasoning blocks and halts early when sufficient confidence has been achieved.
Outcome: The proposed framework improves answer accuracy by up to +13.3% while reducing average reasoning length by 40%–50%.

Similar Papers

CAT: Confidence-Adaptive Thinking for Efficient Reasoning of Large Reasoning Models (2026.acl-industry)

Copied to clipboard

Challenge: Existing compression methods for large reasoning models rely on uniform length reduction or coarse-grained difficulty estimation, often leading to performance degradation on difficult problems.
Approach: They propose a framework that incorporates model’s intrinsic self-certainty signals as confidence into the preference optimization process, which autonomously modulates reasoning lengths based on problem difficulty.
Outcome: The proposed framework outperforms state-of-the-art models on reasoning accuracy across multiple benchmarks on different base models.
ConCISE: Confidence-guided Compression in Step-by-step Efficient Reasoning (2025.emnlp-main)

Copied to clipboard

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.
Your Reasoning Model Knows What Counts: Self-Guided Chain-of-Thought Pruning for Efficient Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to Chain-of-Thought reasoning are often degraded because they disregard the model’s intrinsic reasoning dependency.
Approach: They propose a self-guided pruning framework that leverages the model’s intrinsic likelihood landscape to identify segments that are extraneous to its specific reasoning pattern.
Outcome: The proposed framework reduces output length while maintaining or improving accuracy on multiple benchmarks.
Think Just Enough: Leveraging Self-Assessed Confidence for Adaptive Reasoning in Language Models (2026.findings-eacl)

Copied to clipboard

Challenge: Recent advances in large reasoning models (LLMs) have shown remarkable capabilities in complex tasks such as mathematical problem solving and code generation.
Approach: They propose a method for optimizing reasoning length via self-assessed confidence.
Outcome: The proposed method improves computational efficiency without compromising answer quality.
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.
SAT: Balancing Reasoning Accuracy and Efficiency with Stepwise Adaptive Thinking (2026.acl-long)

Copied to clipboard

Challenge: Large Reasoning Models (LRMs) produce excessively long Chains of Thought (COT) Existing solutions that improve token efficiency but sacrifice fine-grained control can disrupt the logical integrity of the reasoning process.
Approach: They propose a framework that performs step-level, difficulty-aware pruning while preserving the core reasoning structure.
Outcome: Experiments show that SAT reduces reasoning tokens by 40% while maintaining or improving accuracy.
ConfSpec: Efficient Step-Level Speculative Reasoning via Confidence-Gated Verification (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to chain-of-thought reasoning incur high inference latency due to long generation traces.
Approach: They propose a confidence-gated cascaded verification framework that reduces the trade-off between generation and verification.
Outcome: The proposed framework achieves 2.24 speedups while matching target-model accuracy.
Think How to Think: Mitigating Overthinking with Autonomous Difficulty Cognition in Large Reasoning Models (2026.acl-long)

Copied to clipboard

Challenge: Recent Large Reasoning Models (LRMs) excel at complex reasoning tasks but often suffer from overthinking.
Approach: They propose a two-stage fine-tuning strategy that progressively inspires LRMs’ difficulty cognition and redundancy cognition of LRM.
Outcome: The proposed model significantly reduces inference costs by over 70% on easy tasks and 40% on complex ones without compromising performance.
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.
When to Continue Thinking: Adaptive Thinking Mode Switching for Efficient Reasoning (2025.findings-emnlp)

Copied to clipboard

Challenge: Large reasoning models (LRMs) incur excessive computational overhead due to redundant reasoning, especially on simple tasks.
Approach: They propose an Adaptive Self-Recovery Reasoning framework that suppresses unnecessary reasoning and enables implicit recovery.
Outcome: The proposed framework suppresses unnecessary reasoning and enables implicit recovery.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations