Entropy-Aligned Decoding of LMs for Better Writing and Reasoning
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Language models (LMs) are trained on billions of tokens in an attempt to recover the true language distribution. Still, vanilla random sampling from LMs yields low quality generations. Decoding algorithms attempt to restrict the LM distribution to a set of high-probability continuations, but rely on greedy heuristics that introduce myopic distortions, yielding sentences that are homogeneous, repetitive and incoherent. In this paper, we introduce EPIC, a hyperparameter-free decoding approach that incorporates the entropy of future trajectories into LM decoding. EPIC explicitly regulates the amount of uncertainty expressed at every step of generation, aligning the sampling distribution's entropy to the aleatoric (data) uncertainty. Through Entropy-Aware Lazy Gumbel-Max sampling, EPIC manages to be exact, while also being efficient, requiring only a sublinear number of entropy evaluations per step. Unlike current baselines, EPIC yields sampling distributions that are empirically well-aligned with the entropy of the underlying data distribution. Across creative writing and summarization tasks, EPIC consistently improves LM-as-judge preference win-rates over widely used decoding strategies. These preference gains are complemented by automatic metrics, showing that EPIC produces more diverse generations and more faithful summaries. We also evaluate EPIC on mathematical reasoning, where it outperforms all baselines.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 37 of its 50 references that are in the map. First posted on arXiv 5 Jan 2026.
Builds on
37 of 50 references.
Closest ancestors · 1
Same direction, newest first
- 2025TRACE Back from the Future: A Probabilistic Reasoning Approach to Controllable Language Generation25 Apr
Other references · 36
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,530
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,974
- 2019The Curious Case of Neural Text Degenerationcited by 2,881
- 2018Hierarchical Neural Story Generationcited by 1,182
- 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 809
- 2019Plug and Play Language Models: A Simple Approach to Controlled Text Generationcited by 793
- 2021DExperts: Decoding-Time Controlled Text Generation with Experts and Anti-Expertscited by 434
- 2021FUDGE: Controlled Text Generation With Future Discriminatorscited by 374
- 2017Beam Search Strategies for Neural Machine Translationcited by 232
24 more
- 2023Efficient Guided Generation for Large Language Modelscited by 192
- 2022COLD Decoding: Energy-based Constrained Text Generation with Langevin Dynamicscited by 159
- 2014A* Samplingcited by 150
- 2024Turning Up the Heat: Min-p Sampling for Creative and Coherent LLM Outputscited by 148
- 2022Truncation Sampling as Language Model Desmoothingcited by 121
- 2022Locally Typical Samplingcited by 108
- 2024Guiding LLMs The Right Way: Fast, Non-Invasive Constrained Generationcited by 99
- 2020Trading Off Diversity and Quality in Natural Language Generationcited by 94
- 2024Probabilistic Inference in Language Models via Twisted Sequential Monte Carlocited by 85
- 2022Gradient-Based Constrained Sampling from Language Modelscited by 64
- 2019Jointly Measuring Diversity and Quality in Text Generation Modelscited by 61
- 2025Syntactic and Semantic Control of Large Language Models via Sequential Monte Carlocited by 45
- 2019Calibration, Entropy Rates, and Memory in Language Modelscited by 32
- 2024Adaptable Logical Control for Large Language Modelscited by 30
- 2022Neuro-Symbolic Entropy Regularizationcited by 27
- 2023A Pseudo-Semantic Loss for Autoregressive Models with Logical Constraintscited by 21
- 2024Where is the signal in tokenization space?cited by 21
- 2022On the probability-quality paradox in language generationcited by 16
- 2025Neurosymbolic Diffusion Modelscited by 12
- 2024Controllable Generation via Locally Constrained Resamplingcited by 11
- 2017Fast Amortized Inference and Learning in Log-linear Models with Randomly Perturbed Nearest Neighbor Searchcited by 8
- 2013On Sampling from the Gibbs Distribution with Random Maximum A-Posteriori Perturbationscited by 7
- 2025Controlled LLM Decoding via Discrete Auto-regressive Biasingcited by 5
- 2025Semantic Probabilistic Control of Language Modelscited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026FlashSampling: Fast and Memory-Efficient Exact Samplingcited by 2
- 2026FlashSampling: Fast and Memory-Efficient Exact Sampling16 Mar 2026
Similar, not cited
Close in wording, no citation either way
- 2026Entropy-informed Decoding: Adaptive Information-Driven Branching
- 2026Think Twice Before You Write -- an Entropy-based Decoding Strategy to Enhance LLM Reasoning
- 2025p-less Sampling: A Robust Hyperparameter-Free Approach for LLM Decoding
- 2025Semantic uncertainty in advanced decoding methods for LLM generation
- 2024AdaEDL: Early Draft Stopping for Speculative Decoding of Large Language Models via an Entropy-based Lower Bound on Token Acceptance Probability
- 2025Entropy Adaptive Decoding: Dynamic Model Switching for Efficient Inference
- 2026Entropy-Tree: Tree-Based Decoding with Entropy-Guided Exploration
- 2025Entropy-Aware Token Rejection for Improving Speculative Decoding