mlsanityData to 14 Oct 2026

EMS-SD: Efficient Multi-sample Speculative Decoding for Accelerating Large Language Models

arXiv 2405.07542 ↗First posted 13 May 2024cs.CLcited by 3

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

Abstract (arXiv)

Speculative decoding emerges as a pivotal technique for enhancing the inference speed of Large Language Models (LLMs). Despite recent research aiming to improve prediction efficiency, multi-sample speculative decoding has been overlooked due to varying numbers of accepted tokens within a batch in the verification phase. Vanilla method adds padding tokens in order to ensure that the number of new tokens remains consistent across samples. However, this increases the computational and memory access overhead, thereby reducing the speedup ratio. We propose a novel method that can resolve the issue of inconsistent tokens accepted by different samples without necessitating an increase in memory or computing overhead. Furthermore, our proposed method can handle the situation where the prediction tokens of different samples are inconsistent without the need to add padding tokens. Sufficient experiments demonstrate the efficacy of our method. Our code is available at https://github.com/niyunsheng/EMS-SD.

Key facts. Cited by 3 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 17 of its 30 references that are in the map. First posted on arXiv 13 May 2024.

Builds on

17 of 30 references.

Closest ancestors · 7

Same direction, newest first

  1. 2024Kangaroo: Lossless Self-Speculative Decoding via Double Early Exiting29 Apr
  2. 2024Recursive Speculative Decoding: Accelerating LLM Inference via Sampling Without Replacement21 Feb
  3. 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding19 Feb
  4. 2024Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding7 Feb
  5. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  6. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  7. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 10

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2023GPT-4 Technical Reportcited by 18,396
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  4. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  5. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  6. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  7. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
  8. 2023Qwen Technical Reportcited by 3,344
  9. 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,292
  10. 2023Baichuan 2: Open Large-scale Language Modelscited by 670

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Speculative Decoding: Performance or Illusion?
  2. 2024S2D: Sorted Speculative Decoding For More Efficient Deployment of Nested Large Language Models
  3. 2024Improving Multi-candidate Speculative Decoding
  4. 2025Speeding up Speculative Decoding via Sequential Approximate Verification
  5. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding
  6. 2024Decoding Speculative Decoding
  7. 2025Tutorial Proposal: Speculative Decoding for Efficient LLM Inference
  8. 2024A Theoretical Perspective for Speculative Decoding Algorithm