Speculative decoding
PARD
PARD: Accelerating LLM Inference with Low-Cost PARallel Draft Model Adaptation
Superseded baseline#35 of 151 most-superseded · first seen Apr 23, 2025
Superseded — cited as a baseline and beaten by newer methods
2 papers critique it · 1 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites PARD as a baseline.
However, both methods face scalability challenges when training on long sequences.
“PARD an2025pardacceleratingllminference trains small autoregressive models to mimic diffusion-style parallel generation, and then perform speculative decoding for target LLMs. However, the resulting small models lack the modeling capacity of the target LLMs, leading to limited acceptance lengths and a speedup ceiling of approximately 3×”
Beaten on benchmarks
Head-to-head results where a newer method reports beating PARD. Values are copied from the source paper's tables — verify against the cited paper.
PARD-2 beats PARD
6.91 vs 5.14
tau (average acceptance length) · [Q3 14B]
PARD-2: Target-Aligned Parallel Draft Model for Dual-Mode Speculative Decoding
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.
- Jun 3, 2026
- Jun 2, 2026
- Hybrid Verified DecodingHybrid Verified Decoding: Learning to Allocate Verification in Speculative DecodingMay 31, 2026
- May 28, 2026
- May 28, 2026
- May 28, 2026
- May 19, 2026
- May 19, 2026
- May 9, 2026
- May 8, 2026
- May 1, 2026
- Apr 21, 2026