Skip to content
Preprint

XTC: Head-Aware Sampling by Excluding Top Choices

Aug 2026 · 0 citations · 62 references
Computer Science

TL;DR

This work introduces XTC (Exclude Top Choices), a lightweight head-aware decoding operator that targets this regime of open-ended generation in which several continuations are plausible but too much probability mass remains concentrated on the most generic choice.

Abstract

Standard decoding rules for autoregressive language models promote diversity by rescaling the full next-token distribution or truncating its low-probability tail. These strategies overlook a common regime of open-ended generation in which several continuations are plausible but too much probability mass remains concentrated on the most generic choice. We introduce XTC (Exclude Top Choices), a lightweight head-aware decoding operator that targets this regime directly. XTC identifies tokens whose probabilities exceed an absolute plausibility threshold $\tau$: when at least two qualify, it removes the dominant eligible choices with probability $\rho$ and retains only the weakest plausible alternative before renormalization. Across 60 experiments on Gemma 3 27B Q4, Gemma 3 12B Q6, and DeepSeek R1 14B Q6, with scaling validation on Llama 3.3 70B Q4, XTC improves the diversity-repetition Pareto frontier. On creative generation, Distinct-2 increases by 11--15% and repeat trigrams decrease by 27--47% across the four models. Combined with temperature scaling, gains reach 38% in Distinct-2 and 71% in repeat-trigram reduction over baseline. A blinded Amazon Mechanical Turk study with 150 Master raters yields a 62.3% creativity preference for XTC ($p<10^{-4}$) without reduced fluency, while a GPT-4o control judge reproduces the Anthropic-judge direction on every measure. On IFEval with Llama 3.3 70B Q4, XTC preserves prompt-level strict accuracy within 1.7 percentage points of baseline while recovering most of the diversity gain; a temperature setting matched on Distinct-2 reduces IFEval by 8.8 points. The effect is additive with temperature and repetition penalties, robust across quantization levels and model families, and consistent across twelve prompt genres. XTC has been adopted by llama.cpp, ExLlamaV2, and text-generation-webui.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Greedy Decoding Is Not Precision-Invariant: Cross-Precision Output Divergence in LLM Inference

An empirical error-propagation analysis is developed and finds that 22 layers of accumulated body error do not distinguish flipping from non-flipping steps; the outcome depends primarily on the top-two logit margin at the LM head relative to the directional perturbation between the top-two candidates.

Gao-Yuan Du, A. Khan, Rex Zhou et al. · 0 citations
Preprint Aug 2026

ResiSpec: Enhancing Multi-Candidate Speculative Sampling via Residual Distribution Shaping

ResiSpec, a framework that strategically reforms the proposal distribution during verification to anchor the residual target mass within the draft model's high-confidence regions, prevents candidate obsolescence and achieves up to 1.92$\times$ speedup over state-of-the-art multi-candidate methods.

Zhi-Kai Chen, Jun Tao, Wei-Hao Mao et al. · 1 citation
#natural language process... Preprint Sep 2026

Informed Masking: Structure-Aware Perturbation for Reinforcement Learning in Diffusion Large Language Models

This work identifies a systematic upstream/downstream structure in dLLM rollouts and proposes Informed Masking (IM), which derives a per-token priority score from the denoising trajectory at zero extra inference cost and biases mask sampling toward downstream tokens.

Xiao-Yi Yu, E. Sangineto, Pei Fu et al. · 0 citations
Preprint Aug 2026

HalluTracer: Pre-Decoding Truthfulness Prediction via Depth-Averaged Probe-Logit

The proposed method HalluTracer, which averages layer-wise probe logits to predict truthfulness before decoding, achieves the highest area under the receiver operating characteristic curve (AUROC) in 23 of 24 model--benchmark pairs among the compared methods.

Zhi-Hao Guo, Zong-Han Wu, Huan Huo et al. · 0 citations
#natural language process... Preprint Aug 2026

TreeSpark: Calibrated, Load-Adaptive Draft Trees for Semi-Autoregressive Speculative Decoding

TreeSpark is introduced, which reads a parent-conditioned distribution from the drafter's existing Markov head at negligible cost, calibrates it into an edge-acceptance estimate, and lets path survival govern everything else: best-first expansion, per-round stopping, and a load-adaptive serving policy.

Hua-Peng Zhou, Hua-Yu Wang, Xin-Yu Wang · 2 citations · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.