mlsanityData to 7 Oct 2026

APEX: Speculate smarter, not deeper

arXiv 2610.07780 ↗First posted 6 Oct 2026cs.CL cs.LGcited by 0

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

Abstract (arXiv)

Speculative decoding reduces large language model inference latency by drafting multiple tokens before target-model verification, but its effectiveness depends on both the proposal mechanism and draft depth. Fixed configurations cannot respond to changes in predictability, repetition, and acceptance during generation, so deeper drafting can increase wasted computation without proportional speedup. We introduce APEX, a learned controller that balances decoding speed and draft-token waste through request-level expert selection and block-level depth adaptation. APEX-Router selects among EAGLE-3, n-gram, and draft-model speculation for each request, while APEX-Depth adjusts draft length at each verification block using causal decoding signals and recent verifier feedback. APEX models accepted draft length as censored survival feedback, learning position-wise rejection hazards, block execution costs, and an action utility that balances throughput, accepted progress, and wasted tokens. This allows the controller to adapt speculation while retaining the target model's verification procedure. We integrate APEX into vLLM and evaluate it with Qwen3-8B across six workloads, achieving up to 5.24X speedup over autoregressive decoding. Across the aggregate evaluation, APEX-S achieves 4.27X speedup, while APEX-B achieves 3.27X speedup with a 41.0% relative reduction in wasted-token percentage compared with fixed n-gram speculation at k=16, providing distinct operating points for balancing acceleration and draft-token utilization.

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 24 of its 25 references that are in the map. First posted on arXiv 6 Oct 2026.

Builds on

24 of 25 references.

Closest ancestors · 15

Same direction, newest first

  1. 2026Variational Speculative Decoding: Rethinking Draft Training from Token Likelihood to Sequence Acceptance5 Feb
  2. 2025Draft, Verify, and Improve: Toward Training-Aware Speculative Decoding6 Oct
  3. 2025DSDE: Dynamic Speculative Decoding with KLD Stability for Real-World Serving1 Sep
  4. 2025BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms21 May
  5. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  6. 2024AdaEAGLE: Optimizing Speculative Decoding via Explicit Modeling of Adaptive Draft Structures25 Dec
  7. 2024SAM Decoding: Speculative Decoding via Suffix Automaton16 Nov
  8. 2024Dynamic Speculation Lookahead Accelerates Speculative Decoding of Large Language Models7 May
  9. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  10. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  11. 2023REST: Retrieval-Based Speculative Decoding14 Nov
  12. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
3 more
  1. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  2. 2022Fast Inference from Transformers via Speculative Decoding30 Nov
  3. 2022Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generation30 Mar

Other references · 9

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  3. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  4. 2021Program Synthesis with Large Language Modelscited by 3,509
  5. 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,193
  6. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  7. 2023Enhancing Chat Language Models by Scaling High-quality Instructional Conversationscited by 825
  8. 2024Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Servecited by 507
  9. 2022The Stack: 3 TB of permissively licensed source codecited by 354

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Steering Pretrained Drafters during Speculative Decoding
  2. 2026Learning to Draft: Adaptive Speculative Decoding with Reinforcement Learning
  3. 2026When Drafts Evolve: Speculative Decoding Meets Online Learning
  4. 2026From Tokens to Steps: Verification-Aware Speculative Decoding for Efficient Multi-Step Reasoning
  5. 2026PRISM: Parametrically Refactoring Inference for Speculative Sampling Draft Models
  6. 2026Balancing Coverage and Draft Latency in Vocabulary Trimming for Faster Speculative Decoding
  7. 2026Training Parallel Speculative Draft Models by Directly Minimizing Expected Decoding Rounds
  8. 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding