MuTIS: Enhancing Reasoning Efficiency through Multi Turn Intervention Sampling in Reinforcement Learning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for training large reasoning models with long chain-of-thought (CoT) are limited by the number of parameters and the complexity of the model. |
| Approach: | They propose a framework that leverages multi-turn interventions to produce concise reasoning chains and demonstrates strong scalability. |
| Outcome: | The proposed framework breaks the accuracy-efficiency trade-off by producing concise reasoning chains and demonstrating strong scalability on 7B models. |
Similar Papers
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. |
Exploration-Exploitation Reshaping towards Efficient Reasoning for Large Language Models (2026.findings-acl)
Copied to clipboard
Yufeng Shi, Weilin Luo, Yuxiang Zhang, Zongmeng Zhang, Haoyang Liu, Yubing Wang, Bin Wang, Wengang Zhou, Houqiang Li
| Challenge: | Large Reasoning Models (LRMs) are constrained by the overthinking issue. |
| Approach: | They propose a policy optimization framework that reshapes the exploration and exploitation through two core components: self-imitation and self-guidance exploration. |
| Outcome: | The proposed model achieves superior reasoning efficiency without compromising overall accuracy. |
Enhancing Efficiency and Exploration in Reinforcement Learning for LLMs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches allocate an equal number of rollouts to all questions during the RL process, which is inefficient. |
| Approach: | They propose a mechanism for dynamically allocating rollout budgets based on the difficulty of the problems, enabling more efficient RL training. |
| Outcome: | The proposed model improves response precision while preserving exploratory ability to uncover potential correct pathways. |
Towards a Mechanistic Understanding of Large Reasoning Models: A Survey of Training, Inference, and Failures (2026.acl-long)
Copied to clipboard
Yi Hu, Jiaqi Gu, Ruxin Wang, Zijun Yao, Hao Peng, Xiaobao Wu, Jianhui Chen, Muhan Zhang, Liangming Pan
| Challenge: | Recent research has shown that reinforcement learning can elicit intriguing emergent reasoning behaviors. |
| Approach: | They propose a comprehensive survey of the mechanistic understanding of large reasoning models . they organize findings into three core dimensions: 1) training dynamics, 2) reasoning mechanisms, and 3) unintended behaviors. |
| Outcome: | This paper synthesizes the mechanistic understanding of large reasoning models into three dimensions . authors outline a roadmap for future studies including improved interpretability and methodologies . |
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. |
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. |
Rhombus: Incentivizing Coordination in Parallel Thinking through Reinforcement Learning (2026.findings-acl)
Copied to clipboard
Ziyuan Nan, Qi Yi, Di Huang, Yutong Wu, Guanhua Huang, Xue Gong, Kejiao Li, Yuhao Jiang, Chenchen Zhang, Zenan Xu, Xing Hu, Bo Zhou
| Challenge: | Parallel thinking is a promising avenue for scaling test-time compute in Large Language Models . however, coordinating the exploration and aggregation stages remains challenging . |
| Approach: | They propose a parallel thinking framework that explicitly incentivizes coordination between components via end-to-end reinforcement learning. |
| Outcome: | The proposed framework improves accuracy by 6.0% over long chain-of-thought baselines while reducing wall-clock latency by 39.4% under matched token budgets. |
ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization (2025.findings-emnlp)
Copied to clipboard
Zhensheng Jin, Xinze Li, Yifan Ji, Chunyi Peng, Zhenghao Liu, Qi Shi, Yukun Yan, Shuo Wang, Furong Peng, Ge Yu
| Challenge: | Existing methods to train LLMs suffer from overthinking, leading to lengthy reasoning traces . Existing approaches to train large language models suffer from this problem . |
| Approach: | They propose a method to combine multiple reasoning chains for training LLMs . they use stepwise exploration and long-short switched sampling to evaluate reasoning paths . |
| Outcome: | The proposed method reduces reasoning lengths by approximately 30-50% . it also maintains or improves reasoning accuracy compared to baselines . |
Reflect, Rewrite, Repeat: How Simple Arithmetic Enables Advanced Reasoning in Small Language Models (2026.findings-eacl)
Copied to clipboard
Mengdie Flora Wang, Haochen Xie, Mun Young Kim, Baishali Chaudhury, Meghana Ashok, Suren Gunturu, Sungmin Hong, Jae Oh Woo
| Challenge: | Recent advances in language model reasoning require computationally intensive reinforcement learning and massive datasets. |
| Approach: | They propose a framework that combines Direct Preference Optimization and Supervised Fine-Tuning with selective guidance from larger models and iteratively refining solutions through a "reflect, rewrite, repeat" cycle. |
| Outcome: | The proposed framework shows significant performance improvements across arithmetic, symbolic and cognitive reasoning benchmarks. |
Reinforced Efficient Reasoning via Semantically Diverse Exploration (2026.acl-long)
Copied to clipboard
Ziqi Zhao, Zhaochun Ren, Jiahong Zou, Liu Yang, Zhiwei Xu, Xuri Ge, Zhumin Chen, Xinyu Ma, Daiting Shi, Shuaiqiang Wang, Dawei Yin, Xin Xin
| Challenge: | Existing methods for reinforcement learning with verifiable rewards suffer from limited exploration diversity and inefficient reasoning. |
| Approach: | They propose a method that rewards concise and correct reasoning while penalizing unnecessarily long reasoning chains. |
| Outcome: | Extensive experiments on Qwen and Llama models validate the effectiveness and efficiency of ROSE. |