arXiv:2607.03876cs.LG2026-07

针对CPU运行时内存瓶颈,提出自适应推测解码框架,提升小模型推理稳定性。

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

  • 基于实时监控与多策略协同,动态调整推测解码强度。
  • 减少90%以上无效计算,令牌延迟波动降低60%以上。
  • 适合资源受限设备上的低延迟、高可靠大模型推理部署。

随着小型量化GGUF模型在设备端推理中的普及,纯CPU环境下内存带宽严重受限的问题日益突出。固定深度的推测解码虽具潜力,但常因带宽饱和、系统不稳定甚至资源耗尽导致崩溃。为此,我们提出AdaptiveSD——一种全运行时自适应的推测解码框架,确保在各类模型与负载下稳定可靠执行。该框架包含四个紧密协作组件:运行时监控引擎实时追踪多维计算信号;自适应草稿控制器采用十一规则策略层级,优先保障系统资源;动态策略引擎结合启发式与强化学习,根据工作负载行为动态调整策略;KV缓存协调层通过INT8影子缓冲区与位置感知淘汰机制实现细粒度缓存管理。不同于仅关注吞吐量的传统方法,我们以浪费的草稿计算量和跨令牌延迟分散度等指标评估效果,显著优于标准效率指标。

原文摘要 · Abstract (English)

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.

推理优化推测解码内存约束CPU推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。