Speculative decoding
LayerSkip
LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding
Superseded — cited as a baseline and beaten by newer methods
7 papers critique it · 3 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites LayerSkip as a baseline.
However, self-speculative decoding, which uses the same architecture for both draft and target models, inherently limits speedup.
“The performance of EESD hinges on several factors: the early-exit position (which affects draft speed), the draft accuracy (i.e., token acceptance rate), and the number of drafted tokens per step (draft length). Notably, a trade-off exists that more layers involved in drafting improve the acceptance rate but also increase computational cost.”
“Prior works have relied on static configuration of E and γ, selected via offline grid search. This introduces two key limitations. First, the optimal E and γ vary significantly across tasks; configurations tuned for one task often underperform on others.”
“However, applying SSD directly to multimodal models is challenging, as deeper layers are often essential for capturing cross-modal interactions. Simply skipping layers and forwarding shallow outputs to the LM Head degrades performance.”
“More recent self-contained designs like Self-Speculative Decoding (Self-SD) (Zhang et al., 2024) and LayerSkip (Elhoushi et al., 2024) further attempt to reduce computational redundancy by skipping non-critical layers during inference. While these methods highlight the potential of exploiting structural redundancy within LLMs, they typically rely on offline optimization or fine-tuning to identify task-dependent layer configurations, making them less practical in real-world deployment.”
“While self-speculation simplifies the deployment pipeline, it often provides limited acceleration.”
“All existing self-speculative methods share a common assumption: the model is a homogeneous stack of similar layers, and the drafting strategy consists of skipping or shortcutting some of these layers. This assumption breaks down in hybrid architectures, where layers contain fundamentally different computational components.”
Beaten on benchmarks
Head-to-head results where a newer method reports beating LayerSkip. Values are copied from the source paper's tables — verify against the cited paper.
FastVLM beats LayerSkip
40.7 vs 27.4
BLEU4 · [CLIP-LLAMA]
FastVLM: Self-Speculative Decoding for Fast Vision-Language Model InferenceFalcon-H1-0.5B (component-aware SSM-only) beats LayerSkip
0.302 vs 0.473
Total Variation Distance D_TV · [Distribution quality, parallel hybrid 0.5B]
Component-Aware Self-Speculative Decoding in Hybrid Language Models
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.
- May 4, 2026
- Apr 22, 2026
- Apr 16, 2026
- Apr 2, 2026
- greedy multi-path block verification (GBV)Greedy Multi-Path Block Verification for Faster Decoding in Speculative SamplingFeb 18, 2026
- SDFPSDFP: Speculative Decoding with FIT-Pruned Models for Training-Free and Plug-and-Play LLM AccelerationFeb 5, 2026
- Feb 1, 2026
- CAS-Spec (Cascade Adaptive Self-Speculative Decoding)CAS-Spec: Cascade Adaptive Self-Speculative Decoding for On-the-Fly Lossless Inference Acceleration of LLMsOct 30, 2025
- Oct 26, 2025
- Oct 17, 2025
- Oct 1, 2025