Paper recorded by Signals 4 on 2026-10-16 in cs.CL. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-16 on arXiv · recorded by Signals 4 on 2026-10-19
Category: cs.CL · 自然语言处理 · first seen 2026-10-19
Speculative decoding typically characterizes speedup by draft tokens accepted per verification round. Lossless verification preserves the target model's output distribution and thus expected completion length, making this metric a meaningful efficiency proxy. Relaxed (lossy) verification accepts tokens that lossless verification would reject, potentially altering that distribution. We identify a l