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.

Similar Papers

VideoPro: Adaptive Program Reasoning for Long Video Understanding (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for understanding long videos are limited due to the sparsity of visual evidence relevant to a given query.
Approach: They propose a framework that enables VideoLLMs to reason over long videos and refine their predictions through executable programs.
Outcome: The proposed framework outperforms existing methods across long-video understanding benchmarks.
Code to Think, Think to Code: A Survey on Code-Enhanced Reasoning and Reasoning-Driven Code Intelligence in LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Recent breakthrough models like OpenAI-o1 and DeepSeek-R1 show powerful task-solving capabilities, particularly advances in reasoning.
Approach: They propose future research directions that may deepen the synergy, ultimately advancing LLM performance in both complex reasoning and code intelligence.
Outcome: The proposed research may deepen the synergy, ultimately advancing LLM performance in both complex reasoning and code intelligence.
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.
AutoL2S: Auto Long-Short Reasoning for Efficient Large Language Models (2026.findings-acl)

Copied to clipboard

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.
AdaMix: Adaptive Mixing for Short and Long Reasoning Adapters (2026.acl-long)

Copied to clipboard

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.
AlgBench: To What Extent Do Large Reasoning Models Understand Algorithms? (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks for algorithmic reasoning fail to answer a critical question: do LRMs master algorithmic thinking? Empirical evaluations on leading LRM models reveal substantial performance heterogeneity, while models perform well on non-optimized tasks, accuracy drops sharply to around 49% on globally optimized algorithms.
Approach: They propose an algorithm-centric benchmark that evaluates large reasoning models under an algorithmic paradigm.
Outcome: Empirical evaluations on leading LRMs reveal substantial performance heterogeneity . models perform well on non-optimized tasks, accuracy drops sharply to around 49% .
LLM2: Let Large Language Models Harness System 2 Reasoning (2025.naacl-short)

Copied to clipboard

Challenge: Empirical results on mathematical reasoning benchmarks substantiate the efficacy of Large language models (LLMs).
Approach: They propose a framework that combines an LLM with a process-based verifier to generate plausible candidates and provide timely process-driven feedback to distinguish desirable and undesirable outputs.
Outcome: Empirical results show that LLM2 improves accuracy on GSM8K and self-consistency increases major@20 accuracy.
ADaPT: Token-Level Decoupling for Efficient Large Reasoning Models (2026.findings-acl)

Copied to clipboard

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.
Search-o1: Agentic Search-Enhanced Large Reasoning Models (2025.emnlp-main)

Copied to clipboard

Challenge: Large reasoning models (LRMs) have demonstrated impressive long stepwise reasoning capabilities through large-scale reinforcement learning.
Approach: They propose a framework that enhances large reasoning models with an agentic retrieval-augmented generation mechanism and a Reason-in-Documents module for refining retrieved documents.
Outcome: The proposed framework enhances LRMs with an agentic retrieval-augmented generation mechanism and Reason-in-Documents module for refining retrieved documents.
Addressing Overthinking in Large Vision-Language Models via Gated Perception-Reasoning Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Prior work has attempted to mitigate this issue by using adaptive reasoning strategies, but these methods overlook a fundamental bottleneck: visual perception failures.
Approach: They propose a meta-reasoning controller that dynamically routes computation among three decision paths at each generation step.
Outcome: The proposed method outperforms slow-thinking methods while producing shorter responses.

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