SPIRe: Boosting LLM Inference Throughput with Speculative Decoding

Sanjit Neelam, Daniel Heinlein, Vaclav Cvicek, Akshay Mishra, Reiner Pope
4/8/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Speculative decoding (SD) has been shown to reduce the latency of autoregressive decoding (AD) by 2-3x for small batch sizes. However, increasing throughput and therefore reducing the cost per token requires decoding with large batch sizes. Recent work shows that SD can accelerate decoding with large batch sizes too if the context is sufficiently long and the draft model's KV cache is sparse. We introduce SPIRe, a draft model that combines static sparse attention, pruned initialization, and feedback memory to increase the modeled throughput of speculative decoding by over 100% compared to speculation with a much smaller draft model and by over 35% compared to the strong baseline of sparse self-speculation. Our approach is particularly effective when context lengths vary significantly across requests.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{neelam2025spire,
  title  = {SPIRe: Boosting LLM Inference Throughput with Speculative Decoding},
  author = {Sanjit Neelam and Daniel Heinlein and Vaclav Cvicek and Akshay Mishra and Reiner Pope},
  year   = {2025},
  eprint = {2504.06419},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.06419v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.06419.svg)](https://codeofpaper.com/paper/2504.06419)

Discussion