mlsanityData to 14 Oct 2026

Min-k Sampling: Decoupling Truncation from Temperature Scaling via Relative Logit Dynamics

arXiv 2604.11012 ↗First posted 13 Apr 2026cs.AI cs.CL cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

The quality of text generated by large language models depends critically on the decoding sampling strategy. While mainstream methods such as Top-k, Top-p, and Min-p achieve a balance between diversity and accuracy through probability-space truncation, they share an inherent limitation: extreme sensitivity to the temperature parameter. Recent logit-space approaches like Top-nσ achieve temperature invariance but rely on global statistics that are susceptible to long-tail noise, failing to capture fine-grained confidence structures among top candidates. We propose Min-k Sampling, a novel dynamic truncation strategy that analyzes the local shape of the sorted logit distribution to identify "semantic cliffs": sharp transitions from high-confidence core tokens to uncertain long-tail tokens. By computing a position-weighted relative decay rate, Min-k dynamically determines truncation boundaries at each generation step. We formally prove that Min-k achieves strict temperature invariance and empirically demonstrate its low sensitivity to hyperparameter choices. Experiments on multiple reasoning benchmarks, creative writing tasks, and human evaluation show that Min-k consistently improves text quality, maintaining robust performance even under extreme temperature settings where probability-based methods collapse. We make our code, models, and analysis tools publicly available.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 18 of its 31 references that are in the map. First posted on arXiv 13 Apr 2026.

Builds on

18 of 31 references.

References · 18

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  4. 2023Let's Verify Step by Stepcited by 3,789
  5. 2016Pointer Sentinel Mixture Modelscited by 3,096
  6. 2019The Curious Case of Neural Text Degenerationcited by 2,916
  7. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  8. 2018Hierarchical Neural Story Generationcited by 1,193
  9. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 650
  10. 2024Turning Up the Heat: Min-p Sampling for Creative and Coherent LLM Outputscited by 150
  11. 2022Truncation Sampling as Language Model Desmoothingcited by 123
  12. 2023Probing the Creativity of Large Language Models: Can models produce divergent semantic association?cited by 33
6 more
  1. 2024Adaptive Contrastive Search: Uncertainty-Guided Decoding for Open-Ended Text Generationcited by 27
  2. 2024Decoding Decoded: Understanding Hyperparameter Effects in Open-Ended Text Generationcited by 26
  3. 2024Improving Open-Ended Text Generation via Adaptive Decodingcited by 21
  4. 2024Balancing Diversity and Risk in LLM Sampling: How to Select Your Method and Parameter for Open-Ended Text Generationcited by 19
  5. 2025G2: Guided Generation for Enhanced Output Diversity in LLMscited by 14
  6. 2024REAL Sampling: Boosting Factuality and Diversity of Open-Ended Generation via Asymptotic Entropycited by 11

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 9.

9 papers.