mlsanityData to 14 Oct 2026

When RL Meets Adaptive Speculative Training: A Unified Training-Serving System

arXiv 2602.06932 ↗First posted 6 Feb 2026cs.LGcited by 3

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

Abstract (arXiv)

Speculative decoding can significantly accelerate LLM serving, yet most deployments today disentangle speculator training from serving, treating speculator training as a standalone offline modeling problem. We show that this decoupled formulation introduces substantial deployment and adaptation lag: (1) high time-to-serve, since a speculator must be trained offline for a considerable period before deployment; (2) delayed utility feedback, since the true end-to-end decoding speedup is only known after training and cannot be inferred reliably from acceptance rate alone due to model-architecture and system-level overheads; and (3) domain-drift degradation, as the target model is repurposed to new domains and the speculator becomes stale and less effective. To address these issues, we present Aurora, a unified training-serving system that closes the loop by continuously learning a speculator directly from live inference traces. Aurora reframes online speculator learning as an asynchronous reinforcement-learning problem: accepted tokens provide positive feedback, while rejected speculator proposals provide implicit negative feedback that we exploit to improve sample efficiency. Our design integrates an SGLang-based inference server with an asynchronous training server, enabling hot-swapped speculator updates without service interruption. Crucially, Aurora supports day-0 deployment: a speculator can be served immediately and rapidly adapted to live traffic, improving system performance while providing immediate utility feedback. Across experiments, Aurora achieves a 1.5x day-0 speedup on recently released frontier models (e.g., MiniMax M2.1 229B and Qwen3-Coder-Next 80B). Aurora also adapts effectively to distribution shifts in user traffic, delivering an additional 1.25x speedup over a well-trained but static speculator on widely used models (e.g., Qwen3 and Llama3).

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 24 of its 38 references that are in the map. First posted on arXiv 6 Feb 2026.

Builds on

24 of 38 references.

Closest ancestors · 10

Same direction, newest first

  1. 2025Beat the long tail: Distribution-Aware Speculative Decoding for RL Training17 Nov
  2. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  3. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  4. 2024Beyond the Speculative Game: A Survey of Speculative Execution in Large Language Models23 Apr
  5. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
  6. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  7. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
  8. 2023Online Speculative Decoding11 Oct
  9. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  10. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 14

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2025Qwen3 Technical Reportcited by 8,820
  4. 2017Mixed Precision Trainingcited by 1,156
  5. 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,141
  6. 2018Spider: A Large-Scale Human-Labeled Dataset for Complex and Cross-Domain Semantic Parsing and Text-to-SQL Taskcited by 1,139
  7. 2019CodeSearchNet Challenge: Evaluating the State of Semantic Code Searchcited by 654
  8. 2024DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Servingcited by 617
  9. 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 532
  10. 2025MiniMax-M1: Scaling Test-Time Compute Efficiently with Lightning Attentioncited by 263
  11. 2025AReaL: A Large-Scale Asynchronous Reinforcement Learning System for Language Reasoningcited by 250
  12. 2024Mooncake: A KVCache-centric Disaggregated Architecture for LLM Servingcited by 196
2 more
  1. 2024The Mamba in the Llama: Distilling and Accelerating Hybrid Modelscited by 122
  2. 2025Angles Don't Lie: Unlocking Training-Efficient RL Through the Model's Own Signalscited by 13

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Test-Time Speculation
  2. 2026EfficientRollout: System-Aware Self-Speculative Decoding for RL Rollouts
  3. 2026Performance-Driven Policy Optimization for Speculative Decoding with Adaptive Windowing
  4. 2025Draft, Verify, and Improve: Toward Training-Aware Speculative Decoding
  5. 2025ReSpec: Towards Optimizing Speculative Decoding in Reinforcement Learning Systems
  6. 2026Learning to Draft: Adaptive Speculative Decoding with Reinforcement Learning
  7. 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding
  8. 2026Accelerating RL Post-Training Rollouts via System-Integrated Speculative Decoding