Inference & Serving · 2023
Speculative Decoding / Medusa / EAGLE
Introduced speculative decoding, which uses a small fast draft model to propose several tokens that the large target model verifies in parallel, cutting the number of expensive sequential steps without changing the output distribution.
Editorial record
Plain-language summary
Autoregressive generation is slow because each token requires a full forward pass of the large model, run one at a time. Speculative decoding runs a cheap draft model to guess a short run of upcoming tokens, then the large model checks all of them in a single parallel pass and accepts the longest correct prefix, resampling at the first mismatch. A modified acceptance rule guarantees the result matches what the large model would have produced on its own, so it speeds up inference (often 2-3x) with no loss in output quality.
Source record
Provenance
- Record ID
- P-403
- Record created
- 2026-07-13
- Last reviewed
- 2026-07-14
- Record version
- 2
- https://arxiv.org/abs/2211.17192
- arXiv:2211.17192
Citation caveat: Citation metadata is approximate and marked unverified in the source dataset.