Accepted Prefixes Are Not All You Need: A Negative Result on PEFT-Based Block-Diffusion Drafting

Speculative decoding accelerates autoregressive language model inference by using a cheap drafter to propose multiple future tokens and a target model to verify them.

A common design goal is therefore to improve draft quality while reducing auxiliary parameters and systems overhead.

We study a negative result for this direction through PEFT-BD, a same-backbone speculative decoding method in which a LoRA-like adapter acts as a block-diffusion drafter for an autoregressive verifier.

PEFT-BD is motivated by several attractive properties: it avoids tokenizer mismatch, avoids loading a separate draft model, adds only a small number of trainable parameters, and uses a BD3LM-style denoising objective to propose a block of tokens in parallel.

Despite these advantages, PEFT-BD does not yield a practical speedup in our Qwen3-0.6B experiments.

Although the method obtains nontrivial accepted prefixes, profiling shows that each speculative step requires an adapter-enabled full-backbone draft pass followed by an adapter-disabled full-backbone verification pass.

Thus, the drafter is parameter-efficient but not compute-efficient.

Our results isolate a simple but important condition for successful speculative decoding: the drafter must be substantially cheaper to execute than the verifier.

Longer accepted prefixes alone cannot compensate when draft computation remains verifier-scale.