| Challenge: | Existing methods for large reasoning models have improved efficiency but still face limitations such as conflicting objectives and limited adaptability. |
| Approach: | They propose an adaptive reasoning framework that applies a uniform, computation-intensive deep reasoning strategy to all problems. |
| Outcome: | The proposed framework reduces the average response length of DeepSeek-R1-Distill-Qwen-7B by 54.9% while improving accuracy by up to 4.8% on five mathematical datasets. |
Similar Papers
ADaPT: Token-Level Decoupling for Efficient Large Reasoning Models (2026.findings-acl)
Copied to clipboard
Tingyun li, Zishang Jiang, Jinyi Han, Xinyi Wang, Sihang Jiang, Han Xia, Zhaoqian Dai, Ma Shuguang, Fei Yu, Jiaqing Liang, Yanghua Xiao
| Challenge: | Existing efficiency-oriented methods attempt to shorten or mix reasoning strategies, yet often degrade reasoning capability. |
| Approach: | They propose a token-level dual-process framework that explicitly decouples efficiency and correctness signals during training. |
| Outcome: | The proposed framework reduces inference cost while maintaining strong reasoning ability across multiple benchmarks. |
ARM2: Adaptive Reasoning Model with Vision Understanding and Executable Code (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Reasoning Models suffer from the "over-thinking" problem, causing performance degradation. |
| Approach: | They propose a unified model that balances reasoning performance and efficiency across multiple formats through a reinforcement learning framework augmented with length-aware optimization. |
| Outcome: | The proposed model reduces token costs while preserving performance compared to traditional models. |
AdapThink: Adaptive Thinking Preferences for Reasoning Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent research has highlighted a significant inefficiency associated with the slow thinking paradigm . models often overthink simple tasks while underthinking complex challenges . |
| Approach: | They propose a framework for adaptive reasoning preference control that dynamically adjusts reflection preferences based on group-level distributional statistics of reasoning length and reflection intensity. |
| Outcome: | The proposed framework reduces average response length by 17.1%-21.4% while improving performance by 6.12-6.59 points under 32K token budgets. |
AutoL2S: Auto Long-Short Reasoning for Efficient Large Language Models (2026.findings-acl)
Copied to clipboard
Feng Luo, Yu-Neng Chuang, Guanchu Wang, Hoang Anh Duy Le, Shaochen Zhong, Hongyi Liu, Jiayi Yuan, Yang Sui, Vladimir Braverman, Vipin Chaudhary, Xia Hu
| Challenge: | Existing approaches to distilling large language models (LLMs) are inefficient and generate excessively long chain-of-thought reasoning even for inputs that admit concise solutions. |
| Approach: | They propose a distillation framework that empowers non-reasoning LLMs to think only when necessary. |
| Outcome: | The proposed framework reduces reasoning length up to 71% with minimal accuracy loss while preserving accuracy. |
AdaptThink: Reasoning Models Can Learn When to Think (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in large reasoning models have demonstrated remarkable capabilities in tackling complex tasks. |
| Approach: | They propose an algorithm to teach reasoning models to choose the optimal thinking mode based on problem difficulty. |
| Outcome: | The proposed algorithm reduces the average response length and improves accuracy on three math datasets. |
From "Aha Moments" to Controllable Thinking: Toward Meta-Cognitive Reasoning in LRMs via Decoupled Reasoning and Control (2026.acl-long)
Copied to clipboard
| Challenge: | Large Reasoning Models exhibit step-by-step reasoning, reflection, and backtracking, but these behaviors are often unregulated, leading to overthinking. |
| Approach: | They propose a meta-cognitive reasoning framework that decouples reasoning from control to enable independent optimization of control strategies. |
| Outcome: | Experiments show that the proposed model improves efficiency and accuracy across reasoning benchmarks. |
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. |
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. |
X-Router: Decoupling Knowledge and Reasoning for Cost-Effective LLM Inference (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing adaptive methods focus on a single axis, overlooking evidence need and reasoning depth are only partially correlated. |
| Approach: | They propose a dual-axis routing framework that separates retrieval necessity from reasoning necessity under a user-defined cost–quality trade-off. |
| Outcome: | The proposed framework reduces token usage and latency while improving answer quality over strong baselines. |
Marco-o1 v2: Towards Widening The Distillation Bottleneck for Reasoning Models (2025.acl-long)
Copied to clipboard
Huifeng Yin, Yu Zhao, Minghao Wu, Xuanfan Ni, Bo Zeng, Huaiyu.wh Huaiyu.wh, Tianqi Shi, Liangying Shao, Chenyang Lyu, Longyue Wang, Weihua Luo, Kaifu Zhang
| Challenge: | Recent efforts to distill large reasoning models into smaller lightweight models have shown competitive performances. |
| Approach: | They propose to distill long Chain-of-Thought data to improve SFT and RL methods by constructing data from scratch using Monte Carlo Tree Search. |
| Outcome: | The proposed method significantly improves reasoning performance on various benchmarks such as math (GSM8K, MATH, AIME). |