CAS-Spec: Cascade Adaptive Self-Speculative Decoding for On-the-Fly Lossless Inference Acceleration of LLMs
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Speculative decoding has become a widely adopted as an effective technique for lossless inference acceleration when deploying large language models (LLMs). While on-the-fly self-speculative methods offer seamless integration and broad utility, they often fall short of the speed gains achieved by methods relying on specialized training. Cascading a hierarchy of draft models promises further acceleration and flexibility, but the high cost of training multiple models has limited its practical application. In this paper, we propose a novel Cascade Adaptive Self-Speculative Decoding (CAS-Spec) method which constructs speculative draft models by leveraging dynamically switchable inference acceleration (DSIA) strategies, including layer sparsity and activation quantization. Furthermore, traditional vertical and horizontal cascade algorithms are inefficient when applied to self-speculative decoding methods. We introduce a Dynamic Tree Cascade (DyTC) algorithm that adaptively routes the multi-level draft models and assigns the draft lengths, based on the heuristics of acceptance rates and latency prediction. Our CAS-Spec method achieves state-of-the-art acceleration compared to existing on-the-fly speculative decoding methods, with an average speedup from 1.1× to 2.3× over autoregressive decoding across various LLMs and datasets. DyTC improves the average speedup by 47% and 48% over cascade-based baseline and tree-based baseline algorithms, respectively. CAS-Spec can be easily integrated into most existing LLMs and holds promising potential for further acceleration as self-speculative decoding techniques continue to evolve.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 28 of its 33 references that are in the map. First posted on arXiv 30 Oct 2025.
Builds on
28 of 33 references.
Closest ancestors · 20
Same direction, newest first
- 2025CLaSp: In-Context Layer Skip for Self-Speculative Decoding30 May
- 2025ML-SpecQD: Multi-Level Speculative Decoding with Quantized Drafts17 Mar
- 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
- 2024DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure15 Oct
- 2024QSpec: Speculative Decoding with Complementary Quantization Schemes15 Oct
- 2024SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration9 Oct
- 2024MagicDec: Breaking the Latency-Throughput Tradeoff for Long Context Generation with Speculative Decoding20 Aug
- 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
- 2024Speculative Decoding via Early-exiting for Faster LLM Inference with Thompson Sampling Control Mechanism6 Jun
- 2024TriForce: Lossless Acceleration of Long Sequence Generation with Hierarchical Speculative Decoding18 Apr
- 2024CLLMs: Consistency Large Language Models28 Feb
- 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
8 more
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
- 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
- 2023Cascade Speculative Drafting for Even Faster LLM Inference18 Dec
- 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
- 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
- 2022Fast Inference from Transformers via Speculative Decoding30 Nov
- 2022Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generation30 Mar
Other references · 8
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
- 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 217
- 2024SageAttention2: Efficient Attention with Thorough Outlier Smoothing and Per-thread INT4 Quantizationcited by 114
- 2024Training-Free Activation Sparsity in Large Language Modelscited by 55
- 2024AI Flow at the Network Edgecited by 46
- 2024BiTA: Bi-Directional Tuning for Lossless Acceleration in Large Language Modelscited by 13
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026GRAFT: Adaptive DLM-Based Draft Tree Construction with Target-Distilled Edge Scoringcited by 0
- 2026Where Activation Sparsity and KV-Cache Sparsity Cross in LLM Decodingcited by 0
- 2026Reciprocal Guidance: Orchestrating Draft and Verify Budgets for Advancing the Diffusion-AR Self-Speculation Frontiercited by 0
- 2026SEED: Self-Speculative Decoding via Implicit Encoder-Decodercited by 0
- 2026SEED: Self-Speculative Decoding via Implicit Encoder-Decoder29 Sep 2026
- 2026Reciprocal Guidance: Orchestrating Draft and Verify Budgets for Advancing the Diffusion-AR Self-Speculation Frontier28 Sep 2026
- 2026Where Activation Sparsity and KV-Cache Sparsity Cross in LLM Decoding27 Sep 2026
- 2026GRAFT: Adaptive DLM-Based Draft Tree Construction with Target-Distilled Edge Scoring24 Jun 2026
Similar, not cited
Close in wording, no citation either way
- 2025AdaSD: Adaptive Speculative Decoding for Efficient Language Model Inference
- 2024Draft on the Fly: Adaptive Self-Speculative Decoding using Cosine Similarity
- 2025KNN-SSD: Enabling Dynamic Self-Speculative Decoding via Nearest Neighbor Layer Set Optimization
- 2026SpecKV: Adaptive Speculative Decoding with Compression-Aware Gamma Selection
- 2023Draft & Verify: Lossless Large Language Model Acceleration via Self-Speculative Decoding
- 2025Scaling Up, Speeding Up: A Benchmark of Speculative Decoding for Efficient LLM Test-Time Scaling
- 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding
- 2026LK Losses: Direct Acceptance Rate Optimization for Speculative Decoding