Sign inGet started
Paper · arXiv

ReTrace: Rejected-Trajectory Conditioning for Speculative Decoding

Speculative decoding accelerates autoregressive language model inference by having a lightweight draft model propose multiple candidate tokens, which are then verified in parallel by a larger target model. However, after the first rejection, standard prefix-based verification discards the remaining draft suffix, so the computation spent generating and verifying those positions does not contribute to decoding progress. Focusing on DFlash, we show that rejected positions in a rejected suffix may still align with the target continuation, indicating that the draft model can retain useful semantic and structural information despite local token-level errors. Motivated by this observation and in...

AuthorsLuxi Lin, Zhanpeng Zeng, Shuang Peng et al.
Primary categorycs.CL
Published30 August 2026
Last updated at source5 September 2026
cs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/781f80b7-d60e-4b7c-b8ab-1fa48cde0535" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.