DBLAST: Dependent Block Drafting for Stochastic Speculative Decoding
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Speculative decoding accelerates large language models' inference by using a lightweight drafter to propose multiple future tokens and a target model to verify them. While recent block and diffusion-style drafters can predict several positions in a single pass, their training and sampling procedures are typically optimized for greedy decoding or assume that positions in the draft block are conditionally independent. This assumption becomes brittle in non-greedy speculative decoding, where the target distribution is deliberately stochastic and multiple continuations become plausible. We study this mismatch for block diffusion drafters and show that the accepted draft length degrades as the entropy of the target sampling distribution increases. We propose a dependent block drafter based on a low-rank latent mixture over token positions, complemented by an acceptance-oriented training objective that directly targets the expected verified length. Experiments with Qwen3-4B and Qwen3-8B on GSM8K, MT-Bench, HumanEval, and creative-writing benchmarks show that our approach, namely DBLast, consistently improves accepted length over independent block sampling, especially in higher-entropy decoding regimes.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 19 of its 23 references that are in the map. First posted on arXiv 5 Aug 2026.
Builds on
19 of 23 references.
Closest ancestors · 7
Same direction, newest first
- 2026DSpark: Confidence-Scheduled Speculative Decoding with Semi-Autoregressive Generation6 Jul
- 2026SpecForge: A Flexible and Efficient Open-Source Training Framework for Speculative Decoding19 Mar
- 2026DFlash: Block Diffusion for Flash Speculative Decoding5 Feb
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
- 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
- 2022Fast Inference from Transformers via Speculative Decoding30 Nov
Other references · 12
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2019The Curious Case of Neural Text Degenerationcited by 2,916
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
- 2025Understanding R1-Zero-Like Training: A Critical Perspectivecited by 1,345
- 2015A Diversity-Promoting Objective Function for Neural Conversation Modelscited by 1,077
- 2024Better & Faster Large Language Models via Multi-token Predictioncited by 360
- 2022On Decoding Strategies for Neural Text Generatorscited by 90
- 2025Fast and Expressive Multi-Byte Prediction with Probabilistic Circuitscited by 9
- 2024Faster Language Models with Better Multi-Token Prediction Using Tensor Decompositioncited by 8
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026D^2SD: Accelerating Speculative Decoding with Dual Diffusion Draft Models
- 2026Training Parallel Speculative Draft Models by Directly Minimizing Expected Decoding Rounds
- 2026LongSpark: Efficient speculative decoding with a fixed-cost parallel drafter
- 2024Block Verification Accelerates Speculative Decoding
- 2025Fail Fast, Win Big: Rethinking the Drafting Strategy in Speculative Decoding via Diffusion LLMs
- 2026A Practical Investigation of Training-free Relaxed Speculative Decoding
- 2025DiffuSpec: Unlocking Diffusion Language Models for Speculative Decoding
- 2026PACER: Blockwise Pre-verification for Speculative Decoding with Adaptive Length