paper-with-me

Papers

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

2026-07-04 · Sadra Saremi 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.

📄 PDF Abstract BibTeX arXiv:2607.03876

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

StreamServe: Adaptive Speculative Flows for Low-Latency Disaggregated LLM Serving

2026-02-11 · Satyam Kumar, Arpit Singh Gautam, Kailash Talreja, Saurabh Jha arxiv

Efficient LLM serving must balance throughput and latency across diverse, bursty workloads. We introduce StreamServe, a disaggregated prefill decode serving architecture that combines metric aware routing across compute …

Yggdrasil: Bridging Dynamic Speculation and Static Runtime for Latency-Optimal Tree-Based LLM Decoding

2025-12-29 · Yue Guan, Changming Yu, Shihan Fang, Weiming Hu 외 arxiv

Speculative decoding improves LLM inference by generating and verifying multiple tokens in parallel, but existing systems suffer from suboptimal performance due to a mismatch between dynamic speculation and static runtim…

Performance-Driven Policy Optimization for Speculative Decoding with Adaptive Windowing

2026-05-14 · Jie Jiang, Xing Sun, Ruotian Chen, Jianan Su 외 arxiv

Speculative decoding accelerates LLM inference by having a lightweight draft model propose speculative windows of candidate tokens for parallel verification by a larger target model. In practice, speculative efficiency i…

Reinforcement Learning

Ghost Tool Calls: Issue-Time Privacy for Speculative Agent Tools

2026-06-01 · Bardia Mohammadi, Lars Klein, Akhil Arora, Laurent Bindschaedler arxiv

Tool-augmented language agents speculatively issue likely future tool calls to hide latency, but those calls leak inferred user intent to external services before the agent commits to the branch. Every external observer …

Nightjar: Dynamic Adaptive Speculative Decoding for Large Language Models Serving

2025-12-27 · Rui Li, Zhaoning Zhang, Libo Zhang, Huaimin Wang 외 arxiv

Speculative decoding (SD) accelerates LLM inference by verifying draft tokens in parallel. However, this method presents a critical trade-off: it improves throughput in low-load, memory-bound systems but degrades perform…