Speculative decoding
Medusa
Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads
Heavily superseded — a standard baseline that newer methods routinely beat
19 papers critique it · 9 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites Medusa as a baseline.
the Medusa head consists of only a single MLP layer that takes input solely from the final hidden states. Each layer independently speculates on a word at a specified position beyond the next, disregarding the sequential dependencies from previously predicted tokens, which often results in decreased accuracy
“Medusa also hurts MoE performance, as it increases the in-flight tokens by 50-100x and would activate all experts every iteration, for a cost increase of 4x-8x depending on the MoE sparsity, while the ETR increase rarely justifies the cost.”
“Methods like Medusa relax acceptance conditions under non-greedy settings, which do not guarantee lossless acceleration.”
“Tree-attention frameworks—SpecInfer~miao2024specinfer, Medusa~cai2024medusa, and Eagle~li2024eagle, fan2026flatter—expand many branches, quickly exhausting memory.”
“However, Medusa build the token tree directly based on the probability of draft model, instead of a mapping between sampling of draft model and sampling of target model.”
“Although Medusa eliminates the overhead of maintaining an independent draft model, its non-autoregressive MLP heads struggle to capture long-range dependencies.”
“Medusa applies lightweight decoding heads to predict multiple subsequent tokens on the top-layer features of the target model but delivers limited accuracy.”
“All draft heads to date make predictions only as a function of the base model's hidden states from previously verified tokens, making them unaware of earlier tokens in the current candidate continuation. Because of the strong statistical dependencies between neighboring tokens in language, this sequential independence limits the prediction accuracy of existing draft head architectures.”
“it relies solely on hidden states from previously verified tokens, making it blind to earlier unverified predictions within the current draft round.”
“Once alternatives from different depths are combined into a draft tree, they form a large combinatorial space in which many paths are not coherent continuations, and the verifier wastes budget on them.”
“Prevailing methods, medusa, li2024eagle, vicuna68m use small drafters simply trained on datasets such as ShareGPT sharegpt which is often used for instruction tuning of LLMs to learn a pattern of target LLM's language modeling. However, our investigations reveal that such approaches are insufficient for multilingual translation.”
“methods such as Medusa~cai2024medusa eliminate the dependency between heads, thereby accelerating the generation of drafts. However, these methods primarily focus on modeling Syntactic Coherence while neglecting Semantic Coherence.”
Beaten on benchmarks
Head-to-head results where a newer method reports beating Medusa. Values are copied from the source paper's tables — verify against the cited paper.
speculative decoding for Verilog beats Medusa
35.29 vs 11.76
Pass Rate · [CodeT5p, 96K data, VGen]
Speculative Decoding for Verilog: Speed and Quality, All in OneECHO beats Medusa
5.25 vs 2.01
Avg. Speedup · [Vicuna-13B]
ECHO: Elastic Speculative Decoding with Sparse Gating for High-Concurrency ScenariosDREAM-S beats Medusa
3.16 vs 1.72
Average speedup ratio (S) · [LLaVA-v1.6-Vicuna-13B, Temperature=0]
DREAM-S: Speculative Decoding with Searchable Drafting and Target-Aware Refinement for Multimodal GenerationDREAM beats Medusa
2.23 vs 1.38
S (speedup) · [LLaVA-v1.6 Vicuna-7B, Temperature = 0]
DREAM: Drafting with Refined Target Features and Entropy-Adaptive Cross-Attention Fusion for Multimodal Speculative DecodingSpeculative Sampling beats Medusa
2.42 vs 1.53
Avg · [T=0.0 (greedy decoding)]
Towards Fast Multilingual LLM Inference: Speculative Decoding and Specialized DraftersBeagle beats Medusa
3.0 vs 2.0
Speedup · [Vicuna (V) target, MT-Bench]
Cross-Attention Speculative DecodingDART beats Medusa
2.85 vs 2.24
Speedup · [L2 7B Temperature=0]
DART: Diffusion-Inspired Speculative Decoding for Fast LLM InferenceDFlash beats Medusa
2.55 vs 2.28
Speed-up ratio · [LLaVA-1.5, tau=0]
FLASH: Latent-Aware Semi-Autoregressive Speculative Decoding for Multimodal Tasks
What to use instead
Recent methods in the same sub-problem, not yet superseded in the knowledge base — arXiv benchmark leaders, not vetted production recommendations.
- DREAM-SDREAM-S: Speculative Decoding with Searchable Drafting and Target-Aware Refinement for Multimodal GenerationMay 30, 2026
- May 14, 2026
- SpecForgeSpecForge: A Flexible and Efficient Open-Source Training Framework for Speculative DecodingMar 19, 2026
- Mar 13, 2026
- Feb 17, 2026
- Oct 22, 2025
- Oct 22, 2025
- Oct 17, 2025
- Draft, Verify, & Improve (DVI)Draft, Verify, and Improve: Toward Training-Aware Speculative DecodingOct 6, 2025
- FastGRPOFastGRPO: Accelerating Policy Optimization via Concurrency-aware Speculative Decoding and Online Draft LearningSep 26, 2025