FlashMap: Flow Map Speculative Decoding
Speculative decoding accelerates large language model (LLM) inference by using a lightweight drafter to propose a block of tokens that the target model verifies in one parallel pass.
ProofPaper ↗
Key points
- Autoregressive drafters generate this block one token at a time, whereas block diffusion drafters such as DFlash generate it in one pass, making drafting faster.
- However, these diffusion drafters predict each token independently, ignoring dependencies between tokens in the block.
- We introduce FlashMap, a continuous flow drafter that conditions a flow map language model on the target model's hidden states and generates the whole block in one forward pass while capturing inter-token dependencies.
- On Qwen3-8B, FlashMap is faster than a matched DFlash baseline on every benchmark, with 7% higher average speedup and up to 6.1x lossless acceleration.
Sources (1)
- [1]FlashMap: Flow Map Speculative DecodingarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 17, 01:32 AM
Speculative decoding accelerates large language model (LLM) inference by using a lightweight drafter to propose a block of tokens that the target model verifies in one parallel pass.
Autoregressive drafters generate this block one token at a time, whereas block diffusion drafters such as DFlash generate it in one pass, making drafting faster.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 16, 2026Hugging Face ❤️ TorchTPU: TPUs, Natively
- Oct 16, 2026[Research] 2,788 tokens/s on a single RTX 5090 with a diffusion LLM — Introducing ORL (fully open source)
- Oct 16, 2026Acceptance Is Not Speed: Length Inflation in Training-Free Lossy Speculative Decoding
- Oct 16, 2026Deep LLM layers expose passage-level context in EEG during silent reading
- Oct 16, 2026DLite: History-free Speculative Decoding for Agentic AI
- Oct 15, 2026On the SPOT: Enhancing Speculative Decoding for Diffusion Language Models via Commit-Order Prediction