๐ค AI Summary
Existing speculative decoding methods employ fixed draft lengths and rigid acceptance criteria, rendering them ill-suited to the dynamic uncertainty of language models and input complexity. This paper proposes a confidence-modulated adaptive speculative decoding framework: it dynamically adjusts the number of draft tokens per step using entropy- and boundary-aware uncertainty measures; and introduces a confidence-driven, flexible verification strategy to enable efficient and robust parallel decoding. Within an information-theoretic framework, the framework unifies the modeling of draft generation and verification. Experiments demonstrate a 1.8ร average speedup in inference latency, while maintaining or surpassing the BLEU and ROUGE scores of standard speculative decoding on machine translation and text summarization tasksโachieving a favorable trade-off between efficiency and output quality consistency.
๐ Abstract
Speculative decoding has emerged as an effective approach for accelerating autoregressive inference by parallelizing token generation through a draft-then-verify paradigm. However, existing methods rely on static drafting lengths and rigid verification criteria, limiting their adaptability across varying model uncertainties and input complexities. This paper proposes an information-theoretic framework for speculative decoding based on confidence-modulated drafting. By leveraging entropy and margin-based uncertainty measures over the drafter's output distribution, the proposed method dynamically adjusts the number of speculatively generated tokens at each iteration. This adaptive mechanism reduces rollback frequency, improves resource utilization, and maintains output fidelity. Additionally, the verification process is modulated using the same confidence signals, enabling more flexible acceptance of drafted tokens without sacrificing generation quality. Experiments on machine translation and summarization tasks demonstrate significant speedups over standard speculative decoding while preserving or improving BLEU and ROUGE scores. The proposed approach offers a principled, plug-in method for efficient and robust decoding in large language models under varying conditions of uncertainty.