Mitigating Overthinking in Large Reasoning Language Models via Reasoning Path Deviation Monitoring
Authors: Weixin Guan, Liang Li, Jiapeng Liu, Bing Li, Peng Fu, Chengyang Fang, Xiaoshuai Hao, Can Ma, Weiping Wang
Organizations: Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China · School of Cyberspace Security, University of Chinese Academy of Sciences, Beijing, China · School of Computer and Artificial Intelligence, Jiangxi University of Finance and Economics, Jiangxi, China · Xiaomi EV
Large Reasoning Language Models (LRLMs) demonstrate impressive capabilities on complex tasks by utilizing long Chain-of-Thought reasoning. However, they are prone to overthinking, which generates redundant reasoning steps that degrade both performance and efficiency. Recently, early-exit strategies are proposed to mitigate overthinking by dynamically and adaptively terminating redundant reasoning. However, current early-exit methods either introduce extra training overhead by relying on proxy models or limit inference throughput due to the frequent content switching between reasoning and generating probing answers. Moreover, most early-exit methods harm LRLMs performance due to over-truncation. Our insight stems from an observation: overthinking often causes LRLMs to deviate from the correct reasoning path, which is frequently accompanied by high-entropy transition tokens. Given this, we propose an early-exit method deeply coupled with the native reasoning process, which leverages the path deviation index as a dedicated monitoring metric for the frequent occurrence of high-entropy transition tokens to dynamically detect and terminate overthinking trajectories. We conduct experiments across multiple benchmarks using LRLMs of different types and scales, and the results indicate that our method delivers the largest performance improvement over vanilla CoT compared to existing early-exit methods.
Figures & tables
Figure 1: Reasoning trajectory dissection revealing the “overthinking” trap. The model initially achieves the correct result but fails due to a flawed verification loop. The frequent emergence of transition tokens ( e.g. , “Wait,” “But”) serves as a key indicator of reasoning deviation.
Figure 2: Token Entropy Contribution Distribution. This figure illustrates the distribution of 45.9 million tokens, sorted by their entropy values from low to high. The tokens are divided into 100 percentile bins, with the y-axis representing the percentage contribution of the total entropy within each bin relative to the aggregate entropy of all tokens.
Figure 3: Visualization of High-Frequency Tokens among Top Entropy Contributors. This figure highlights the most frequent tokens within the 20% of tokens that contributed most to the average entropy. Only tokens that constitute complete English words are retained.
Figure 4: Overview of RPDI-EE. RPDI-EE performs continuous entropy scanning during CoT generation. For each new token, it measures local uncertainty via the Local Reasoning Density (LRD), defined as the average token entropy in a sliding window, and compares it to the global reasoning stability reflected by the Global Reasoning Baseline (GRB).
Math Easy
Math Hard
Scientific
Average
Method
Acc. ↑
Len. ↓
Acc. ↑
Len. ↓
Acc. ↑
Len. ↓
Acc. ↑
Len. ↓
DeepSeek-R1-Distill-Qwen-7B
87.9
3801
32.5
10395
32.3
10319
56.2
7558
+ NoThinking
77.6 -10.3
912
25.2 -7.3
3277
31.3 -1.0
841
48.5 -7.7
1915
+ ThinkLess
76.8 -11.1
758
24.7 -7.8
3736
31.8 -0.5
1175
48.0 -8.2
2094
+ Dynasor-CoT
73.8 -14.1
1673
32.4 -0.1
3366
45.5 +13.2
1876
52.0 -4.2
2428
+ DEER
85.4 -2.5
2733
45.0 +12.5
9005
28.3 -4.0
9433
59.9 +3.7
6378
Table 1: Performance comparison. Subscripts in all Acc. columns denote the accuracy change relative to the Vanilla CoT. Limited by computing resources and costs, RPDI-EE is only compared with Vanilla CoT and the most competitive DEER across all eight LRLMs.
Figure 5: Triggering Rates and Corrective Performance.
Method
Math
Math
Scientific
Average
Easy
Hard
Vanilla CoT
91.6
52.9
52.0
67.6
RPDI-EE
93.5
61.0
64.7
75.5
w/o GTF
93.5
57.7
64.7
74.0
w/o LTF
90.2
56.4
62.1
71.7
w/o BTM
93.6
53.5
67.7
72.7
Table 2: Effectiveness Ablation of the RPDI components.
Figure 6: Hyperparameter Ablation of RPDI-EE .
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
Method
Probing-free
Proxy-Model-free
Dynamic Method
Efficiency Gain
Performance Gain
Real-time
RPDI (Ours)
✓
✓
✓
✓
✓
✓
Answer-Probing Based
Deer ( Yang et al., 2025b )
✗
✓
✓
✓
✓
✓
Adaptive Think ( Yong et al., 2025 )
✗
✓
✓
✓
✓
✗
Dynasor-CoT ( Fu et al., 2025 )
✗
✓
✓
✓
✗
✓
Proxy-Model Based
Appendix
Table 3: Feature-level comparison between RPDI and existing early-exit frameworks. We evaluate methods across six critical dimensions: (1) Probing-free : avoids intermediate answer generation to maintain a continuous reasoning flow; (2) Proxy-Model-free : operates without auxiliary verifiers or additional training; (3) Dynamic Method : adaptively adjusts the reasoning length based on problem complexity; (4) Efficiency Gain : provides measurable reduction in latency compared to vanilla CoT; (5) Performance Gain : achieves accuracy improvements by mitigating overthinking while safeguarding against over-truncation; (6) Real-time : functions during the generation process rather than via offline post-processing.
Figure 7: Comparison of generated content between RPDI-EE and Vanilla on AIME24.
Figure 8: Comparison of generated content between RPDI-EE and Vanilla on OlympiadBench.
Figure 9: Comparison of generated content between RPDI-EE and Vanilla on OlympiadBench.
Figure 10: Comparison of generated content between RPDI-EE and Vanilla on OlympiadBench.
Large reasoning models (LRMs) have achieved remarkable performance in complex reasoning tasks, driven by their powerful inference-time scaling capability. However, LRMs often suffer from overthinking, which results in substantial computational redundancy and significantly reduces efficiency. Early-exit methods aim to mitigate this issue by terminating reasoning once sufficient evidence has been generated, yet existing approaches mostly rely on handcrafted or empirical indicators that are unreliable and impractical. In this work, we introduce Dynamic Thought Sufficiency in Reasoning (DTSR), a novel framework for efficient reasoning that enables the model to dynamically assess the sufficiency of its chain-of-thought (CoT) and determine the optimal point for early exit. Inspired by human metacognition, DTSR operates in two stages: (1) Reflection Signal Monitoring, which identifies reflection signals as potential cues for early exit, and (2) Thought Sufficiency Check, which evaluates whether the current CoT is sufficient to derive the final answer. Experimental results on the Qwen3 models show that DTSR reduces reasoning length by 28.9%-34.9% with minimal performance loss, effectively mitigating overthinking. We further discuss overconfidence in LRMs and self-evaluation paradigms, providing valuable insights for early-exit reasoning.
Large Reasoning Models (LRMs) improve performance by generating explicit intermediate reasoning traces through increased test-time compute, yet the assumption that longer reasoning is consistently beneficial remains under-examined. While recent evidence shows that additional reasoning can lead models to overthink, we ask: "Once a model has reached the correct answer, does further reasoning refine the solution, or deviate from it?" To study the dynamics after correctness, we introduce a prefix-level trajectory evaluation protocol grounded in reasoning sufficiency, defining the minimum reasoning budget required for a model to first generate the correct answer. This allows us to disentangle verbose overthinking, where additional reasoning is redundant but harmless, from harmful overthinking, where continued reasoning destabilizes an already-correct trajectory. Starting from multimodal benchmarks, we find that many instances considered reasoning-intensive require surprisingly little reasoning. Moreover, stopping at the first correct prefix improves accuracy over standard reasoning up to 21%, revealing that current models are limited not only by their ability to reason, but also by their inability to stop at the right time. Furthermore, while common efficiency strategies like early stopping substantially reduce verbose overthinking (up to 50%), they fail to mitigate harmful overthinking. Failure analysis reveals that correctness deviations are mainly driven by logical drift and visual reinterpretation. Finally, we show that our findings generalize to language-only reasoning benchmarks, highlighting harmful overthinking as a broader reliability risk. Code available at https://simonecaldarella.github.io/thinking-past-the-answer.
Simone Caldarella, Davide Talon, Rahaf Aljundi +2
University of Trento · 3Fondazione Bruno Kessler · 2Toyota Motor Europe
Large reasoning models (LRMs) have achieved strong performance on challenging mathematical and scientific tasks through long chain-of-thought reasoning, but they often suffer from overthinking with unnecessary reasoning steps. Existing truncation-based methods typically detect consecutive trial-answer agreement and force early exit, yet such local stopping signals do not necessarily indicate final-answer stability and can disrupt useful subsequent reflection or verification, potentially leading to performance degradation. We propose consistency-aware logit masking (CALM), a training-free decoding intervention for mitigating overthinking in LRMs. CALM first monitors trial answers at step boundaries and then applies logit masking to action transition point (ATP) tokens such as "Wait", "Alternatively", and "Hmm", suppressing redundant transitional reasoning while allowing the model to continue its thought process more naturally. Experiments across four advanced LRMs and five benchmarks show that CALM reduces token consumption by 18.6%-25.0% compared with full CoT reasoning while maintaining performance, and can even improve accuracy by 0.07%-1.48% by reducing redundant reasoning. LLM-as-a-Judge results also demonstrate that CALM provides more coherent and concise results.
Shengjing Liu, Feiyang Li, Yuxuan Yang +2
College of Computer Science and Software Engineering, Shenzhen University