Steering Pretrained Drafters during Speculative Decoding
Frédéric Berdoz, Peer Rheinboldt, Roger Wattenhofer
TL;DR
This work addresses latency in autoregressive LLM inference by enhancing speculative decoding with a pretrained drafter. It introduces SD2, a lightweight dynamic steering mechanism that computes a steering vector from the verifier's hidden states and injects it into the drafter, increasing token acceptance and throughput while keeping overhead negligible. Training uses synthetic verifier data and a KL-divergence objective to align the drafter with the verifier, while the verifier remains fixed; results show up to 35% more tokens accepted and up to 22% higher throughput compared to distillation across several verifier-drafter pairs and tasks. SD2 is retrofit-friendly, preserving performance on long sequences and demonstrating robustness to distribution shifts, making it a practical upgrade for existing speculative decoding pipelines.
Abstract
Speculative decoding accelerates language model inference by separating generation into fast drafting and parallel verification. Its main limitation is drafter-verifier misalignment, which limits token acceptance and reduces overall effectiveness. While small drafting heads trained from scratch compensate with speed, they struggle when verification dominates latency or when inputs are out of distribution. In contrast, pretrained drafters, though slower, achieve higher acceptance rates thanks to stronger standalone generation capabilities, making them competitive when drafting latency is negligible relative to verification or communication overhead. In this work, we aim to improve the acceptance rates of pretrained drafters by introducing a lightweight dynamic alignment mechanism: a steering vector computed from the verifier's hidden states and injected into the pretrained drafter. Compared to existing offline alignment methods such as distillation, our approach boosts the number of accepted tokens by up to 35\% under standard sampling and 22\% under greedy sampling, all while incurring negligible computational overhead. Importantly, our approach can be retrofitted to existing architectures and pretrained models, enabling rapid adoption.
