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. |
Similar Papers
Chain-of-Thought Matters: Improving Long-Context Language Models with Reasoning Path Supervision (2025.findings-emnlp)
Copied to clipboard
Dawei Zhu, Xiyu Wei, Guangxiang Zhao, Wenhao Wu, Haosheng Zou, Junfeng Ran, null XWang, Lin Sun, Xiangzheng Zhang, Sujian Li
| Challenge: | Recent advances in Large Language Models (LLMs) have highlighted the challenge of handling long-context tasks. |
| Approach: | They propose a chain-of-thought framework that teaches models to generate high-quality reasoning paths for enhanced long-context performance. |
| Outcome: | The proposed framework generalizes across most long-context scenarios and amplifys with increasing context length. |
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. |
CAC-CoT: Connector-Aware Compact Chain-of-Thought for Efficient Reasoning Data Synthesis Across Dual-System Cognitive Tasks (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Long chain-of-thought (CoT) prompting often slows or even degrades performance on fast, intuitive "System-1" tasks. |
| Approach: | They introduce a method that deliberately restricts reasoning to a small, fixed set of connector phrases, steering the model toward concise and well-structured explanations. |
| Outcome: | The method achieves 85% on GSM8K and 40% on GPQA while also surpassing the baseline by over 20%. |
SoftCoT: Soft Chain-of-Thought for Efficient Reasoning with LLMs (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to continuous-space reasoning focus on hard token decoding and suffer from catastrophic forgetting. |
| Approach: | They propose a method that generates instance-specific soft thought tokens as the initial chain of thoughts and maps them into the LLM’s representation space via a trainable projection module. |
| Outcome: | The proposed method improves LLM reasoning performance through supervised, parameter-efficient fine-tuning. |
Self-Training Elicits Concise Reasoning in Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Chain-of-thought reasoning has enabled large language models to use additional computation through intermediate tokens to solve complex tasks, but current models often generate more tokens than necessary to accomplish the task, incurring extraneous inference costs. |
| Approach: | They propose to fine-tune models with self-generated concise reasoning paths obtained by best-of-N sampling and few-shot conditioning in task-specific settings to elicit concise reasoning. |
| Outcome: | The proposed method reduces output tokens by 30% on GSM8K and MATH while maintaining average accuracy. |
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. |
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. |
Markov Chain of Thought for Efficient Mathematical Reasoning (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing studies have sought to enhance the mathematical reasoning capabilities of large language models. |
| Approach: | They propose a Markov Chain of Thought (MCoT) that compresses previous reasoning steps into a simplified question. |
| Outcome: | The proposed method improves efficiency and maintains comparable accuracy. |
Pru-CoT: Towards Efficient Reasoning Distillation via Pruning Chain-of-Thought (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing heuristics fail to capture global causal logic due to rigid rules and limited search spaces. |
| Approach: | They propose a framework that extracts the essential logical structure from reasoning chains. |
| Outcome: | Experiments show that Pru-CoT models generate more compact reasoning paths compared to models trained on verbose data. |
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. |