AdaPLD: Adaptive Retrieval and Reuse for Efficient Model-Free Speculative Decoding
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Speculative decoding accelerates generation by verifying multiple drafted tokens in a single target-model forward pass, reducing sequential decoding iterations. Model-free variants avoid auxiliary draft models by reusing text and model states already available during generation, but their speedup depends on the reliability of the constructed drafts. We identify two limitations of existing reuse-based methods: lexically anchored retrieval has limited recall under surface-form variation, and deterministic span copying can be brittle when the retrieved context does not uniquely determine the continuation. We propose AdaPLD, a training-free method that adaptively improves both retrieval and draft construction. AdaPLD preserves high-precision lexical reuse while using semantic similarity to recover additional reuse opportunities when lexical matching fails. It further constructs branched reuse hypotheses to account for continuation uncertainty, rather than relying on a single copied span. Across diverse benchmarks, AdaPLD reduces target-model forward passes and achieves up to 3.10× decoding speedup.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 24 of its 30 references that are in the map. First posted on arXiv 4 Jun 2026.
Builds on
24 of 30 references.
Closest ancestors · 12
Same direction, newest first
- 2025Cacheback: Speculative Decoding With Nothing But Cache15 Nov
- 2025LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation2 Jul
- 2025Accelerated Test-Time Scaling with Model-Free Speculative Sampling5 Jun
- 2025DReSD: Dense Retrieval for Speculative Decoding21 Feb
- 2024PLD+: Accelerating LLM inference by leveraging Language Model Artifacts2 Dec
- 2024SAM Decoding: Speculative Decoding via Suffix Automaton16 Nov
- 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
- 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
- 2023REST: Retrieval-Based Speculative Decoding14 Nov
- 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
- 2022Fast Inference from Transformers via Speculative Decoding30 Nov
Other references · 12
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2023Let's Verify Step by Stepcited by 3,598
- 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,758
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 848
- 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 809
- 2023LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compressioncited by 443
- 2024Turning Trash into Treasure: Accelerating Inference of Large Language Models with Token Recyclingcited by 48
- 2023Extending Context Window of Large Language Models via Semantic Compressioncited by 45
- 2023Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracycited by 37
- 2025Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inferencecited by 10
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026RACER: Retrieval-Augmented Contextual Rapid Speculative Decoding
- 2025When, What, and How: Rethinking Retrieval-Enhanced Speculative Decoding
- 2025AdaSD: Adaptive Speculative Decoding for Efficient Language Model Inference
- 2026SENSE: Semantic Embedding Navigation with Soft-gated Evaluation for Retrieval-based Speculative Decoding
- 2025Scaling Up, Speeding Up: A Benchmark of Speculative Decoding for Efficient LLM Test-Time Scaling
- 2025RASD: Retrieval-Augmented Speculative Decoding
- 2024SSSD: Simply-Scalable Speculative Decoding
- 2026Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decoding