ReSpec: Towards Optimizing Speculative Decoding in Reinforcement Learning Systems
Qiaoling Chen, Zijun Liu, Peng Sun, Shenggui Li, Guoteng Wang, Ziming Liu, Yonggang Wen, Siyuan Feng, Tianwei Zhang
TL;DR
ReSpec tackles the generation bottleneck in RL-based LLM adaptation by integrating adaptive speculative decoding with a tight feedback loop from on-policy signals. It introduces an Adaptive SD Server and an Online Learner that uses Reward-Weighted Knowledge Distillation and asynchronous updates to keep the lightweight drafter aligned with an evolving actor, while dynamically tuning SD configurations. The approach mitigates three critical issues—diminishing speedups, drafter staleness, and policy degradation—through adaptive scheduling, continual drafter evolution, and reward-aware updates. Empirically, ReSpec achieves up to 4.5x end-to-end speedup on Qwen 3B–14B with stable reward convergence, making efficient RL-based LLM adaptation practical at scale.
Abstract
Adapting large language models (LLMs) via reinforcement learning (RL) is often bottlenecked by the generation stage, which can consume over 75\% of the training time. Speculative decoding (SD) accelerates autoregressive generation in serving systems, but its behavior under RL training remains largely unexplored. We identify three critical gaps that hinder the naive integration of SD into RL systems: diminishing speedups at large batch sizes, drafter staleness under continual actor updates, and drafter-induced policy degradation. To address these gaps, we present ReSpec, a system that adapts SD to RL through three complementary mechanisms: dynamically tuning SD configurations, evolving the drafter via knowledge distillation, and weighting updates by rollout rewards. On Qwen models (3B--14B), ReSpec achieves up to 4.5x speedup while preserving reward convergence and training stability, providing a practical solution for efficient RL-based LLM adaptation.
