mlsanityData to 7 Oct 2026

Spec-AUF: Accept-Until-Fail Training under Train-Inference Misalignment for Masked Block Drafters

arXiv 2607.01893 ↗First posted 2 Jul 2026cs.AI cs.CLcited by 3

On the map: Efficient LLM inference and serving → Speculative decoding

Abstract (arXiv)

Speculative decoding accelerates autoregressive generation by drafting a block of tokens that the target model verifies left-to-right, committing only the longest accepted prefix. Block (DLM-style) drafters predict the whole block in parallel, which is fast but trained with a full-block cross-entropy that supervises every position against the gold continuation -- even though inference discards every token after the first rejection. Recent acceptance-aware objectives patch this by reweighting the full-block loss; we instead use teacher-forced learning as a motivation for how supervision should concentrate on the accepted prefix. A mask-only block drafter has no input-side channel for gold-prefix conditioning, so AUF approximates that prefix-sensitive supervision on the loss side by keeping the cross-entropy support only through the drafter's first predicted failure. AUF is a single, detached change to the CE support -- no auxiliary objective, no verifier rollouts, and no change to the inference pipeline or the exactness contract. Within fixed drafter backbones and serving settings on Qwen3-8B, AUF raises the DFlash drafter's average emitted length τ, averaged over six benchmarks, from 2.40 to 2.61, with a gain on every benchmark, and transfers to Domino's two-branch head (2.56 to 2.68). Two findings sharpen the picture: the decay-only baseline reaches higher token accuracy on the shared block mask yet decodes worse, and on DFlash, once AUF truncates the support, the standard exponential position-decay weighting becomes empirically inert.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 14 of its 20 references that are in the map. First posted on arXiv 2 Jul 2026.

Builds on

14 of 20 references.

Closest ancestors · 10

Same direction, newest first

  1. 2026Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decoding28 May
  2. 2026D-PACE: Dynamic Position-Aware Cross-Entropy for Parallel Speculative Drafting12 May
  3. 2026LK Losses: Direct Acceptance Rate Optimization for Speculative Decoding27 Feb
  4. 2026DFlash: Block Diffusion for Flash Speculative Decoding5 Feb
  5. 2026Variational Speculative Decoding: Rethinking Draft Training from Token Likelihood to Sequence Acceptance5 Feb
  6. 2025SpecDiff-2: Scaling Diffusion Drafter Alignment For Faster Speculative Decoding1 Nov
  7. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  8. 2025GRIFFIN: Effective Token Alignment for Faster Speculative Decoding16 Feb
  9. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  10. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 4

  1. 2015How (not) to Train your Generative Model: Scheduled Sampling, Likelihood, Adversary?cited by 76
  2. 2025From Next-Token to Next-Block: A Principled Adaptation Path for Diffusion LLMscited by 22
  3. 2026DreamReasoner-8B: Block-Size Curriculum Learning for Diffusion Reasoning Modelscited by 4
  4. 2026Teaching Diffusion to Speculate Left-to-Rightcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Draft, Verify, and Improve: Toward Training-Aware Speculative Decoding
  2. 2026DEdit: Iterative Draft Editing for Speculative Decoding
  3. 2026Ceiling-Clipped Acceptance Histograms Indicate Stranded Speed-up in Block-Diffusion Speculative Decoding
  4. 2026TAPS: Task Aware Proposal Distributions for Speculative Sampling
  5. 2026Accepted Prefixes Are Not All You Need: A Negative Result on PEFT-Based Block-Diffusion Drafting
  6. 2026From Chains to Trees: Parent-Conditioned Drafting for Semi-Autoregressive Speculative Decoding
  7. 2026SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Drafting
  8. 2025FastEagle: Cascaded Drafting for Accelerating Speculative Decoding