mlsanityData to 7 Oct 2026

Nightjar: Dynamic Adaptive Speculative Decoding for Large Language Models Serving

arXiv 2512.22420 ↗First posted 27 Dec 2025cs.DC cs.AIcited by 6

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

Abstract (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 performance in high-load, compute-bound environments due to verification overhead. Existing speculative decoding methods use fixed lengths and cannot adapt to workload changes or decide when to stop speculation. The cost of restarting speculative inference also remains unquantified. Under high load, the benefit of speculation diminishes, while retaining the draft model reduces KV cache capacity, limiting batch size and degrading throughput. To overcome this, we propose Nightjar, a resource-aware adaptive speculative framework. It first adjusts to the request load by dynamically selecting the optimal speculative length for different batch sizes. Crucially, Nightjar proactively disables speculative decoding when the MAB planner determines that speculation is no longer beneficial, and during the disabled phase, offloads the draft model to the CPU only under GPU memory pressure. This reclaims memory for the KV cache, thereby facilitating larger batch sizes and maximizing overall system throughput. Experiments show that Nightjar achieves up to 14.76% higher throughput than standard speculative decoding and up to 20.18% lower latency in the main benchmark suite under dynamic request arrival rates for real-time LLM serving scenarios.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 21 of its 47 references that are in the map. First posted on arXiv 27 Dec 2025.

Builds on

21 of 47 references.

Closest ancestors · 12

Same direction, newest first

  1. 2025BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms21 May
  2. 2025TETRIS: Optimal Draft Token Selection for Batch Speculative Decoding21 Feb
  3. 2024Dovetail: A CPU/GPU Heterogeneous Speculative Decoding for LLM inference25 Dec
  4. 2024AdaEAGLE: Optimizing Speculative Decoding via Explicit Modeling of Adaptive Draft Structures25 Dec
  5. 2024Dynamic Depth Decoding: Faster Speculative Decoding for LLMs30 Aug
  6. 2024MagicDec: Breaking the Latency-Throughput Tradeoff for Long Context Generation with Speculative Decoding20 Aug
  7. 2024OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure25 Jun
  8. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  9. 2024SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths30 May
  10. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
  11. 2023The Synergy of Speculative Decoding and Batching in Serving Large Language Models28 Oct
  12. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 9

  1. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  2. 2022Efficiently Scaling Transformer Inferencecited by 529
  3. 2019Batched Multi-armed Bandits Problemcited by 97
  4. 2017Efficient Contextual Bandits in Non-stationary Worldscited by 62
  5. 2023A Survey of Techniques for Optimizing Transformer Inferencecited by 35
  6. 202570% Size, 100% Accuracy: Lossless LLM Compression for Efficient GPU Inference via Dynamic-Length Float (DFloat11)cited by 23
  7. 2025eLLM: Elastic Memory Management Framework for Efficient LLM Servingcited by 4
  8. 2025FineServe: Precision-Aware KV Slab and Two-Level Scheduling for Heterogeneous Precision LLM Servingcited by 3
  9. 2023Adaptive Endpointing with Deep Contextual Multi-armed Banditscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 6.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025AdaSD: Adaptive Speculative Decoding for Efficient Language Model Inference
  2. 2025SpecRouter: Adaptive Routing for Multi-Level Speculative Decoding in Large Language Models
  3. 2026AdaptiveSD A Stability-Aware, Runtime-Adaptive Speculative Decoding Framework with Multi-Policy Orchestration for CPU-Constrained LLM Inference
  4. 2026CATS: Cascaded Adaptive Tree Speculation for Memory-Limited LLM Inference Acceleration
  5. 2025AdaSpec: Adaptive Speculative Decoding for Fast, SLO-Aware Large Language Model Serving
  6. 2026SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding
  7. 2024Decoding Speculative Decoding
  8. 2025Speculative Verification: Exploiting Information Gain to Refine Speculative Decoding