Speculative Decoding in One Subtraction: Why Even Backward Guessers Preserve Output

anbarth · x · 2026-10-26

Antje Barth breaks down the math of speculative decoding: a small model guesses tokens, a big model verifies them. The share of guesses kept equals the overlap between the two probability distributions — a perfect guesser keeps everything, while a uniform guess (equal chance across Qwen3-8B's 151,936-token vocabulary) keeps almost nothing.

The striking takeaway: even a guesser with every chance backwards still gets 30% of guesses thrown out, yet the output is exactly identical to the big model's — provable with a single subtraction. The original post includes a step-by-step walkthrough with code.

Related event: AWS Explains Why Speculative decoding Never Changes LLM Output(2 posts)→

Original post →

More from Infra

Infra channel →