Autoregressive language model generation is fundamentally memory bandwidth bound rather than compute bound.
Speculative decoding leverages a lightweight draft model to generate candidate tokens in parallel, which are verified by the primary model in a single forward pass.
Because the target model’s probability distribution is mathematically preserved, generation speed multiplies without any loss in output quality.