mlsanityData to 7 Oct 2026

AdaptiveSD A Stability-Aware, Runtime-Adaptive Speculative Decoding Framework with Multi-Policy Orchestration for CPU-Constrained LLM Inference

arXiv 2607.03876 ↗First posted 4 Jul 2026cs.LGcited by 0

On the map: Efficient LLM inference and serving → Speculative decoding

Abstract (arXiv)

With the rise of small quantized GGUF-based language models and their increasing use for on-device inference tasks, we have seen the growing need for an approach capable of reliably delivering these models at scale even under severe memory bandwidth constraints such as those imposed by pure CPU implementations. Fixed-depth speculative decoding has emerged as one promising technique, but in practice, it often leads to performance degradation due to either bandwidth saturation, instability, or even catastrophic resource exhaustion resulting in system failure. To overcome this problem, we introduce AdaptiveSD, a fully runtime-adaptive speculative decoding framework aimed at ensuring robust, reliable execution across the spectrum of model types and workloads. Our solution consists of four tightly-coupled components working together in a continuous feedback loop: a Runtime Monitoring Engine tracking multiple signals relevant to ongoing computation, an Adaptive Draft Controller enforcing an eleven rule policy hierarchy prioritizing system resource preservation over raw draft count, a Dynamic Policy Engine employing a suite of heuristic and reinforcement learning techniques to dynamically modify policies depending upon workload behavior, and finally, a KV Cache Coordination Layer managing cache states with fine-grained control through INT8 shadow buffers and position aware evictions. While conventional approaches focus solely on maximizing throughput, we instead assess the effectiveness of our approach based on several key metrics including wasted drafted compute and inter-token latency dispersion alongside standard measures of speculative efficiency.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 10 of its 12 references that are in the map. First posted on arXiv 4 Jul 2026.

Builds on

10 of 12 references.

Closest ancestors · 6

Same direction, newest first

  1. 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
  2. 2024SpecExec: Massively Parallel Speculative Decoding for Interactive LLM Inference on Consumer Devices4 Jun
  3. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  4. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
  5. 2023Accelerating LLM Inference with Staged Speculative Decoding8 Aug
  6. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 4

  1. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
  2. 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 571
  3. 2019Introduction to Multi-Armed Banditscited by 475
  4. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Nightjar: Dynamic Adaptive Speculative Decoding for Large Language Models Serving
  2. 2025DSDE: Dynamic Speculative Decoding with KLD Stability for Real-World Serving
  3. 2025AdaSD: Adaptive Speculative Decoding for Efficient Language Model Inference
  4. 2025AdaSpec: Adaptive Speculative Decoding for Fast, SLO-Aware Large Language Model Serving
  5. 2025SpecRouter: Adaptive Routing for Multi-Level Speculative Decoding in Large Language Models
  6. 2026CATS: Cascaded Adaptive Tree Speculation for Memory-Limited LLM Inference Acceleration
  7. 2024SSSD: Simply-Scalable Speculative Decoding
  8. 2026SpecQuant: Speculative Decoding with Multi-Parent Quantization for Adaptive LLM Inference