mlsanityData to 7 Oct 2026

BV Loss: Block Verification-Aware Loss for Block Diffusion Speculative Decoding

arXiv 2609.34832 ↗First posted 28 Sep 2026cs.AI cs.CLcited by 0

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

Abstract (arXiv)

Diffusion drafters accelerate speculative decoding by proposing multiple tokens in parallel. Despite recent advances in speculative decoding through sequence-level drafting and verification, existing training objectives remain largely designed around token-level verification. To address this mismatch, we introduce Block Verification-aware loss (BV loss), a training objective designed to maximize the expected acceptance length of a drafted sequence. BV loss is directly derived from the block verification acceptance rule, providing a principled connection between the drafter training objective and the inference-time verification mechanism at the sequence level. Across math, code, and chat benchmarks, BV loss increases the mean number of tokens accepted per verification call under block verification by 13.0--21.0% over cross-entropy loss training for DFlash and DSpark with Qwen3-4B and Qwen3-8B without changing the inference procedure. BV loss also outperforms tokenwise acceptance objectives such as TV loss and LK loss, and its gains extend to token verification and greedy decoding. These results demonstrate the benefit of training block diffusion drafters with an objective aligned with sequence-level verification, rather than optimizing each token independently.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 17 of its 18 references that are in the map. First posted on arXiv 28 Sep 2026.

Builds on

17 of 18 references.

Closest ancestors · 9

Same direction, newest first

  1. 2026LK Losses: Direct Acceptance Rate Optimization for Speculative Decoding27 Feb
  2. 2026DFlash: Block Diffusion for Flash Speculative Decoding5 Feb
  3. 2025Traversal Verification for Speculative Tree Decoding18 May
  4. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  5. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  6. 2024Block Verification Accelerates Speculative Decoding15 Mar
  7. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  8. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  9. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 8

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  4. 2023Let's Verify Step by Stepcited by 3,598
  5. 2021Program Synthesis with Large Language Modelscited by 3,509
  6. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  7. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
  8. 2024The Perfect Blend: Redefining RLHF with Mixture of Judgescited by 43

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026SpecTr-GBV: Multi-Draft Block Verification Accelerating Speculative Decoding
  2. 2025Fail Fast, Win Big: Rethinking the Drafting Strategy in Speculative Decoding via Diffusion LLMs
  3. 2026Accelerating Speculative Diffusions via Block Verification
  4. 2026Ceiling-Clipped Acceptance Histograms Indicate Stranded Speed-up in Block-Diffusion Speculative Decoding
  5. 2026TAPS: Target-Aware Prefix Tree Selection for Diffusion-Drafted Speculative Decoding
  6. 2026DScale: Scaling Block-Diffusion Speculative Decoding with Adaptive Verification
  7. 2026D-Loop: Looped Diffusion Drafting for Speculative Decoding
  8. 2026Cost-Aware Diffusion Draft Trees for Speculative Decoding