mlsanityData to 14 Oct 2026

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

arXiv 2604.00018 ↗First posted 10 Mar 2026cs.CL cs.AIcited by 1

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 22 of its 55 references that are in the map. First posted on arXiv 10 Mar 2026.

Builds on

22 of 55 references.

Closest ancestors · 1

Same direction, newest first

  1. 2025Entropy After </Think> for reasoning model early exiting30 Sep

Other references · 21

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2023GPT-4 Technical Reportcited by 18,396
  3. 2024The Llama 3 Herd of Modelscited by 14,715
  4. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  5. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
  6. 2024GPT-4o System Cardcited by 4,588
  7. 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
  8. 2023Let's Verify Step by Stepcited by 3,789
  9. 2022Constitutional AI: Harmlessness from AI Feedbackcited by 3,050
  10. 2025Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoningcited by 559
  11. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
  12. 2023Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoningcited by 391
9 more
  1. 2024Chain-of-Table: Evolving Tables in the Reasoning Chain for Table Understandingcited by 188
  2. 2022Faithful Reasoning Using Large Language Modelscited by 130
  3. 2025A Survey of Uncertainty Estimation Methods on Large Language Modelscited by 62
  4. 2024Deductive Beam Search: Decoding Deducible Rationale for Chain-of-Thought Reasoningcited by 24
  5. 2025Large Language Models and Mathematical Reasoning Failurescited by 22
  6. 2022A Call for Clarity in Beam Search: How It Works and When It Stopscited by 10
  7. 2024ReasonAgain: Using Extractable Symbolic Programs to Evaluate Mathematical Reasoningcited by 9
  8. 2025Comprehension Without Competence: Architectural Limits of LLMs in Symbolic Computation and Reasoningcited by 9
  9. 2025Evaluation of LLMs for mathematical problem solvingcited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025Think Just Enough: Sequence-Level Entropy as a Confidence Signal for LLM Reasoning
  2. 2026Taming the Thinker: Conditional Entropy Shaping for Adaptive LLM Reasoning
  3. 2026Entropy-Tree: Tree-Based Decoding with Entropy-Guided Exploration
  4. 2025Sample Smart, Not Hard: Correctness-First Decoding for Better Reasoning in LLMs
  5. 2025Entropy-Gated Branching for Efficient Test-Time Reasoning
  6. 2025Less is More: Improving LLM Reasoning with Minimal Test-Time Intervention
  7. 2026Entropy-informed Decoding: Adaptive Information-Driven Branching
  8. 2025DiffAdapt: Difficulty-Adaptive Reasoning for Token-Efficient LLM Inference