mlsanityData to 14 Oct 2026

Distributed Speculative Inference (DSI): Speculation Parallelism for Provably Faster Lossless Language Model Inference

arXiv 2405.14105 ↗First posted 23 May 2024cs.DC cs.AI cs.CLcited by 9

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

Abstract (arXiv)

This paper introduces distributed speculative inference (DSI), a novel inference algorithm that is provably faster than speculative inference (SI) [leviathan2023, chen2023, miao2024, sun2025, timor2025] and standard autoregressive inference (non-SI). Like other SI algorithms, DSI operates on frozen language models (LMs), requiring no training or architectural modifications, and it preserves the target distribution. Prior studies on SI have demonstrated empirical speedups over non-SI--but rely on sufficiently fast and accurate drafters, which are often unavailable in practice. We identify a gap where SI can be slower than non-SI if drafters are too slow or inaccurate. We close this gap by proving that DSI is faster than both SI and non-SI--given any drafters. DSI is therefore not only faster than SI, but also unlocks the acceleration of LMs for which SI fails. DSI leverages speculation parallelism (SP), a novel type of task parallelism, to orchestrate target and drafter instances that overlap in time, establishing a new foundational tradeoff between computational resources and latency. Our simulations show that DSI is 1.29-1.92x faster than SI in single-node setups for various off-the-shelf LMs and tasks. We open-source all our code.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 40 of its 62 references that are in the map. First posted on arXiv 23 May 2024.

Builds on

40 of 62 references.

Closest ancestors · 12

Same direction, newest first

  1. 2024Dynamic Speculation Lookahead Accelerates Speculative Decoding of Large Language Models7 May
  2. 2024Block Verification Accelerates Speculative Decoding15 Mar
  3. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  4. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  5. 2023SpecTr: Fast Speculative Decoding via Optimal Transport23 Oct
  6. 2023DistillSpec: Improving Speculative Decoding via Knowledge Distillation12 Oct
  7. 2023Online Speculative Decoding11 Oct
  8. 2023Accelerating LLM Inference with Staged Speculative Decoding8 Aug
  9. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
  10. 2023Speculative Decoding with Big Little Decoder15 Feb
  11. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  12. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 28

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  4. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  5. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  6. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  7. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  8. 2021Program Synthesis with Large Language Modelscited by 3,637
  9. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  10. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,592
  11. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
  12. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
16 more
  1. 2015Teaching Machines to Read and Comprehendcited by 1,049
  2. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  3. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  4. 2021Efficient Large-Scale Language Model Training on GPU Clusters Using Megatron-LMcited by 632
  5. 2022InCoder: A Generative Model for Code Infilling and Synthesiscited by 498
  6. 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 426
  7. 2022DeepSpeed-MoE: Advancing Mixture-of-Experts Inference and Training to Power Next-Generation AI Scalecited by 404
  8. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 323
  9. 2022Confident Adaptive Language Modelingcited by 310
  10. 2019Depth-Adaptive Transformercited by 236
  11. 2022Language model compression with weighted low-rank factorizationcited by 195
  12. 2022Language Models as Agent Modelscited by 132
  13. 2021Sequence Parallelism: Long Sequence Training from System Perspectivecited by 126
  14. 2024The Hedgehog & the Porcupine: Expressive Linear Attentions with Softmax Mimicrycited by 120
  15. 2021Consistent Accelerated Inference via Confident Adaptive Transformerscited by 74
  16. 2020Controlling Computation versus Quality for Neural Sequence Modelscited by 27

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 4.

9 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding
  2. 2024Speculative Streaming: Fast LLM Inference without Auxiliary Models
  3. 2024ParallelSpec: Parallel Drafter for Efficient Speculative Decoding
  4. 2025Scaling LLM Speculative Decoding: Non-Autoregressive Forecasting in Large-Batch Scenarios
  5. 2025READER: Retrieval-Assisted Drafter for Efficient LLM Inference
  6. 2026Training Parallel Speculative Draft Models by Directly Minimizing Expected Decoding Rounds
  7. 2026Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting
  8. 2026Faster LLM Inference via Sequential Monte Carlo