Skip to content

Latest commit

 

History

5 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Awesome Speculative Decoding Awesome

745 papers (2018–2026), 52 hand-annotated. The corpus is harvested programmatically from OpenAlex, filtered for relevance, and classified against the taxonomy in notes/taxonomy.md — so it is reproducible and re-runnable rather than a snapshot of one person's reading. This list is the companion artifact to a survey paper; the LaTeX source lives in paper/.

Start here · ⭐⭐ Must read · ⭐⭐⭐ Add-on · ◆ historical landmark


The one-paragraph version

Autoregressive decoding is memory-bandwidth-bound: generating one token requires streaming every weight of the model through the memory hierarchy, so the arithmetic units sit mostly idle. Scoring many tokens in one forward pass costs almost the same wall-clock time as scoring one. Speculative decoding exploits exactly this: a cheap drafter guesses the next few tokens, the expensive target model verifies them all in a single pass, and an acceptance rule commits the longest correct prefix. With the rejection-sampling rule of Leviathan et al. and Chen et al., the committed text is distributed identically to ordinary sampling from the target — the speedup is free of quality cost. Research since then has been a search along three axes: making drafts cheaper, making them more likely to be accepted, and making the whole thing survive contact with a real batched serving system.

Contents


Reading Guide & Timeline

Follow the must-read line from left to right, then use the short picks inside each category.

⭐⭐ Must-read timeline, by first public appearance:

2018-11 Blockwise2022-03 SpecDec2022-11 Exact SD2023-05 SpecInfer2023-09 Draft & Verify2023-10 DistillSpec2023-10 Batching × SD2023-11 REST2024-01 Medusa2024-01 EAGLE2024-04 TriForce2024-04 MTP


Foundations & Surveys

Surveys & Position Papers

Prior overviews of the field.

Reading picks

More papers in this category

Lossless Acceptance

The rejection-sampling rule that makes speculation exact, and its analyses.

Reading picks

More papers in this category

Drafting: Where Proposals Come From

Independent Draft Models

A separate smaller model proposes; the classic two-model setup.

Reading picks

More papers in this category

Self-Drafting

The target model drafts for itself via early exit, layer skipping, or Jacobi iteration.

Reading picks

More papers in this category

Auxiliary Prediction Heads

Lightweight heads on the target's hidden states (Medusa, EAGLE, and descendants).

Reading picks

More papers in this category

Retrieval, N-gram & Model-Free

Proposals copied from the prompt or a datastore; no draft forward pass at all.

Reading picks

More papers in this category

Multi-Token Prediction Objectives

Pretraining the model to emit several tokens per step.

Reading picks

More papers in this category

Cascades & Hierarchies

Three or more tiers; drafters that themselves speculate.

Reading picks

More papers in this category

Verification: What Gets Committed

Token-Tree Verification

Verify many branches at once under a tree attention mask.

Reading picks

More papers in this category

Relaxed & Lossy Acceptance

Trading exact distribution preservation for more accepted tokens.

Reading picks

More papers in this category

Multi-Draft & Optimal Acceptance

Several proposals per step; the optimal rule is an optimal-transport problem.

Reading picks

More papers in this category

Training & Aligning Drafters

Distillation

Acceptance rate is an alignment metric, so distil the drafter toward the target.

Reading picks

More papers in this category

Online & Test-Time Adaptation

Adapt the drafter to the live query distribution.

Reading picks

More papers in this category

Drafter Architecture

Capacity, latency, and design-space choices.

Reading picks

More papers in this category

Systems, Serving & Hardware

Batching, Scheduling & Throughput

Speculation spends FLOPs to buy latency; the trade inverts at large batch.

Reading picks

More papers in this category

Distributed & Pipelined Serving

Overlapping draft and verify across devices.

Reading picks

More papers in this category

KV Cache, Offloading & Quantization

How speculation composes with the other memory optimisations.

Reading picks

More papers in this category

On-Device & Edge

Where the memory-bound argument is strongest.

Reading picks

More papers in this category

Production Implementations

vLLM, TensorRT-LLM, SGLang, llama.cpp, and friends.

Implementation-first reading

This branch changes faster than papers can track it. Start with the current vLLM, TensorRT-LLM, SGLang, llama.cpp, or Hugging Face documentation for your stack, then use the papers below for implementation case studies.

More papers in this category

Applications & Modalities

Long Context

Where speculation becomes attractive again at large batch.

Reading picks

More papers in this category

Multimodal, Speech & Video

Reading picks

More papers in this category

Reasoning & Test-Time Compute

Reading picks

More papers in this category

Agents, Tool Use & Structured Output

Reading picks

More papers in this category

Retrieval-Augmented Generation

Reading picks

More papers in this category

Diffusion & Non-Autoregressive Models

Reading picks

More papers in this category

Mixture-of-Experts Targets

Reading picks

More papers in this category

Domain-Specific Applications

Translation, code, biomedical, recommendation.

Reading picks

More papers in this category

Theory & Evaluation

Speedup Models & Analysis

Expected acceptance length, optimal draft length.

Reading picks

More papers in this category

Optimality & Limits

Reading picks

More papers in this category

Benchmarks & Measurement

Wall-clock versus block-efficiency, and how to compare fairly.

Reading picks

More papers in this category

Statistics

Papers per year (by first public appearance):

Year Papers
2018 1
2022 2
2023 16 ██
2024 113 ████████████
2025 244 ██████████████████████████
2026 (partial) 369 ████████████████████████████████████████

The corpus snapshot ends 2026-07-25, so 2026 is a partial year and is further under-counted by catalogue indexing lag — treat its row as a lower bound.

Papers per taxonomy branch:

Category Papers
survey — Surveys & Position Papers 18
verify-lossless — Lossless Acceptance 34
draft-independent — Independent Draft Models 120
draft-self — Self-Drafting 37
draft-heads — Auxiliary Prediction Heads 52
draft-retrieval — Retrieval, N-gram & Model-Free 22
draft-mtp — Multi-Token Prediction Objectives 27
draft-cascade — Cascades & Hierarchies 7
verify-tree — Token-Tree Verification 36
verify-relaxed — Relaxed & Lossy Acceptance 12
verify-multidraft — Multi-Draft & Optimal Acceptance 5
train-distill — Distillation 19
train-online — Online & Test-Time Adaptation 5
train-arch — Drafter Architecture 1
sys-batching — Batching, Scheduling & Throughput 121
sys-distributed — Distributed & Pipelined Serving 13
sys-memory — KV Cache, Offloading & Quantization 42
sys-edge — On-Device & Edge 36
sys-impl — Production Implementations 10
app-longcontext — Long Context 9
app-multimodal — Multimodal, Speech & Video 36
app-reasoning — Reasoning & Test-Time Compute 40
app-agents — Agents, Tool Use & Structured Output 6
app-rag — Retrieval-Augmented Generation 2
app-diffusion — Diffusion & Non-Autoregressive Models 12
app-moe — Mixture-of-Experts Targets 4
app-domain — Domain-Specific Applications 3
theory-analysis — Speedup Models & Analysis 5
theory-optimal — Optimality & Limits 3
eval-benchmark — Benchmarks & Measurement 8

Regenerate with make stats (writes figures to paper/figures/).

License

Apache-2.0 for the code; the bibliography is factual metadata.

About

A curated list of awesome speculative decoding papers

Resources

Stars

4 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages