A training-free speculative decoder using the verifier's hidden states as a semantic key retrieves correct continuations unreachable by exact suffix matching, lifting accepted length 24-29%.
name" field and an
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Oilbird: Training-Free Speculative Decoding with Keys the Verifier Already Computes
A training-free speculative decoder using the verifier's hidden states as a semantic key retrieves correct continuations unreachable by exact suffix matching, lifting accepted length 24-29%.