Explore Briefly, Then Decide: Mitigating LLM Overthinking via Cumulative Entropy Regulation

Tianyi Jiang, Yi Bin, Yujuan Ding, Kainian Zhu, Fei Ma +2 more
10/2/2025
cs.CLcs.AIcs.LG

No official code found. Best implementation: AusertDream/CumulativeEntropyRegulation (7 stars, last commit 2026-03-21).

Abstract

Large Language Models (LLMs) have demonstrated remarkable reasoning abilities on complex problems using long Chain-of-Thought (CoT) reasoning. However, they often suffer from overthinking, meaning generating unnecessarily lengthy reasoning steps for simpler problems. This issue may degrade the efficiency of the models and make them difficult to adapt the reasoning depth to the complexity of problems. To address this, we introduce a novel metric Token Entropy Cumulative Average (TECA), which measures the extent of exploration throughout the reasoning process. We further propose a novel reasoning paradigm -- Explore Briefly, Then Decide -- with an associated Cumulative Entropy Regulation (CER) mechanism. This paradigm leverages TECA to help the model dynamically determine the optimal point to conclude its thought process and provide a final answer, thus achieving efficient reasoning. Experimental results across diverse mathematical benchmarks show that our approach substantially mitigates overthinking without sacrificing problem-solving ability. With our thinking paradigm, the average response length decreases by up to 71% on simpler datasets, demonstrating the effectiveness of our method in creating a more efficient and adaptive reasoning process.

View on arXivView PDF

Code Implementations(1)

Explore Briefly, Then Decide: Mitigating LLM Overthinking via Cumulative Entropy Regulation.

71Shell, PythonSep 27, 20257 months ago

Similar Papers

Cite this paper

@article{jiang2025explore,
  title  = {Explore Briefly, Then Decide: Mitigating LLM Overthinking via Cumulative Entropy Regulation},
  author = {Tianyi Jiang and Yi Bin and Yujuan Ding and Kainian Zhu and Fei Ma and Jingkuan Song and Heng Tao Shen},
  year   = {2025},
  eprint = {2510.02249},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.02249v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.02249.svg)](https://codeofpaper.com/paper/2510.02249)

Discussion