Think Twice Before You Write -- an Entropy-based Decoding Strategy to Enhance LLM Reasoning

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: He, Jiashu, Liu, Meizhu, Olaleye, Olaitan P, Agarwal, Amit, Avendi, M., Abbasi, Yassi, Rowe, Matthew, Patel, Hitesh Laxmichand, Li, Paul, Sheng, Tao, Ravi, Sujith, Roth, Dan
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866912993189560320
author He, Jiashu
Liu, Meizhu
Olaleye, Olaitan P
Agarwal, Amit
Avendi, M.
Abbasi, Yassi
Rowe, Matthew
Patel, Hitesh Laxmichand
Li, Paul
Sheng, Tao
Ravi, Sujith
Roth, Dan
author_facet He, Jiashu
Liu, Meizhu
Olaleye, Olaitan P
Agarwal, Amit
Avendi, M.
Abbasi, Yassi
Rowe, Matthew
Patel, Hitesh Laxmichand
Li, Paul
Sheng, Tao
Ravi, Sujith
Roth, Dan
contents Decoding strategies play a central role in shaping the reasoning ability of large language models (LLMs). Traditional methods such as greedy decoding and beam search often suffer from error propagation, while sampling-based approaches introduce randomness without adequate robustness. Self-consistency improves reliability by aggregating multiple rollouts, but incurs significant computational overhead. We propose an entropy-guided decoding framework that introduces token-level adaptivity into generation. At each step, the model computes the entropy of the token distribution, identifies high-uncertainty positions, and selectively branches on these vulnerable points. A dynamic pool of partial rollouts is maintained and expanded until solutions are completed, concentrating computation where uncertainty is greatest and avoiding unnecessary exploration in confident regions. To enable efficient termination, we apply a rollout-level Entropy After </Think> (EAT) stopping criterion by performing entropy evaluation after the full reasoning trace, rather than incrementally at every step. Experiments on GSM8K, AMC2023, and their perturbed variants demonstrate that our method achieves consistently strong accuracy. Notably, on smaller LLMs, performance is comparable to GPT-5 while operating at a fraction of the cost.
format Preprint
id arxiv_https___arxiv_org_abs_2604_00018
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Think Twice Before You Write -- an Entropy-based Decoding Strategy to Enhance LLM Reasoning
He, Jiashu
Liu, Meizhu
Olaleye, Olaitan P
Agarwal, Amit
Avendi, M.
Abbasi, Yassi
Rowe, Matthew
Patel, Hitesh Laxmichand
Li, Paul
Sheng, Tao
Ravi, Sujith
Roth, Dan
Computation and Language
Artificial Intelligence
Decoding strategies play a central role in shaping the reasoning ability of large language models (LLMs). Traditional methods such as greedy decoding and beam search often suffer from error propagation, while sampling-based approaches introduce randomness without adequate robustness. Self-consistency improves reliability by aggregating multiple rollouts, but incurs significant computational overhead. We propose an entropy-guided decoding framework that introduces token-level adaptivity into generation. At each step, the model computes the entropy of the token distribution, identifies high-uncertainty positions, and selectively branches on these vulnerable points. A dynamic pool of partial rollouts is maintained and expanded until solutions are completed, concentrating computation where uncertainty is greatest and avoiding unnecessary exploration in confident regions. To enable efficient termination, we apply a rollout-level Entropy After </Think> (EAT) stopping criterion by performing entropy evaluation after the full reasoning trace, rather than incrementally at every step. Experiments on GSM8K, AMC2023, and their perturbed variants demonstrate that our method achieves consistently strong accuracy. Notably, on smaller LLMs, performance is comparable to GPT-5 while operating at a fraction of the cost.
title Think Twice Before You Write -- an Entropy-based Decoding Strategy to Enhance LLM Reasoning
topic Computation and Language
Artificial Intelligence
url https://arxiv.org/abs/2604.00018