arXiv:2603.03333cs.CL2026-03

无需训练的采样方法提升大模型推理速度

Training-free Dropout Sampling for Semantic Token Acceptance in Speculative Decoding

  • 用蒙特卡洛丢弃法在语言模型头生成多条解码路径,评估候选词一致性
  • 在多个基准上实现1.09倍至1.33倍推理加速,最高可额外提升1.09倍
  • 无需训练、数据或校准,可无缝集成现有加速技术

推测解码通过轻量级草稿模型提出候选词,并由目标模型选择性接受以加速大语言模型推理。本文提出DropMatch,一种仅对语言模型头部施加蒙特卡洛丢弃的新方法,通过生成多个解码路径形成经验性词分布,用于匹配草稿词与目标模型预测分布的一致性。该机制使模型能自适应控制解码路径规模,在合适的丢弃概率下避免目标模型预测分布显著失真。所提方法为免训练、免数据、免校准,无需修改预训练模型架构,可与多种现有推测解码和推理加速技术正交集成。在多个基准上的实验表明,该方法在保持竞争性任务性能的同时提升了接受长度,相较标准基线获得1.09x至1.33x的推理加速,当与EAGLE3结合时还可额外实现1.09x加速。

原文摘要 · Abstract (English)

Speculative decoding accelerates large language model inference by proposing tokens with a lightweight draft model and selectively accepting them using a target model. This work introduces DropMatch, a novel approach that matches draft tokens to the predictive distribution of the target model via Monte Carlo dropout applied exclusively to the LM head, enabling sampling-based acceptance decisions. By generating multiple decoding paths, our method forms an empirical token distribution against which draft tokens are evaluated for consistency. This acceptance mechanism enables the model to adaptively control the size of decoding paths under an appropriate dropout probability, preventing substantial distortion of the target model predictive distribution. The proposed method operates in a training-free, data-free, and calibration-free manner, requires no architectural modification to pretrained models, and can be orthogonally integrated with a wide range of existing speculative decoding and inference acceleration techniques. Experiments across multiple benchmarks demonstrate that our approach increases acceptance length while maintaining competitive task performance, yielding inference speedups ranging from 1.09x to 1.33x over the standard baseline, and up to an additional 1.09x speedup when applied on top of EAGLE3.

推理加速推测解码无训练

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。