English
Related papers

Related papers: Speculative Decoding with CTC-based Draft Model fo…

200 papers

Speculative sampling is a popular technique for accelerating inference in Large Language Models by generating candidate tokens using a fast draft model and accepting or rejecting them based on the target model's distribution. While…

Machine Learning · Computer Science 2025-07-08 Valentin De Bortoli , Alexandre Galashov , Arthur Gretton , Arnaud Doucet

Speculative decoding is a widely used technique for accelerating inference in large language models (LLMs), but its performance degrades as input length grows, with significant drops even at moderate lengths. Yet, this early degradation has…

Computation and Language · Computer Science 2026-01-21 Jungyoub Cha , Hyunjong Kim , Sungzoon Cho

Speculative decoding can substantially accelerate LLM inference, but realizing its benefits in practice is challenging due to evolving workloads and system-level constraints. We present TIDE (Temporal Incremental Draft Engine), a…

Machine Learning · Computer Science 2026-02-06 Jiyoung Park , Hankyu Jang , Changseok Song , Wookeun Jung

Inference latency stands as a critical bottleneck in the large-scale deployment of Large Language Models (LLMs). Speculative decoding methods have recently shown promise in accelerating inference without compromising the output…

Machine Learning · Computer Science 2025-10-31 Ruilin Wang , Huixia Li , Yuexiao Ma , Xiawu Zheng , Fei Chao , Xuefeng Xiao , Rongrong Ji

While speculative decoding has recently appeared as a promising direction for accelerating the inference of large language models (LLMs), the speedup and scalability are strongly bounded by the token acceptance rate. Prevalent methods…

Machine Learning · Computer Science 2024-10-16 Yunfan Xiong , Ruoyu Zhang , Yanzeng Li , Tianhao Wu , Lei Zou

Speculative decoding aims to speed up autoregressive generation of a language model by verifying in parallel the tokens generated by a smaller draft model.In this work, we explore the effectiveness of learning-free, negligible-cost draft…

Machine Learning · Computer Science 2024-11-07 Lawrence Stewart , Matthew Trager , Sujan Kumar Gonugondla , Stefano Soatto

As large language models (LLMs) scale up, accuracy improves, but the autoregressive (AR) nature of decoding increases latency since each token requires a serial forward pass. Speculative decoding addresses this by employing a fast drafter…

Computation and Language · Computer Science 2025-10-06 Guanghao Li , Zhihui Fu , Min Fang , Qibin Zhao , Ming Tang , Chun Yuan , Jun Wang

Speculative decoding accelerates autoregressive generation by letting draft tokens bypass full verification, but conventional frameworks suffer from frequent false rejections, particularly when draft models produce semantically correct but…

Computation and Language · Computer Science 2026-04-16 Xuwen Zhou , Fangxin Liu , Chao Wang , Xiao Zheng , Hao Zheng , Min He , Li Jiang , Haibing Guan

Speculative decoding is an effective and lossless approach for accelerating LLM inference. However, existing widely adopted model-based draft designs, such as EAGLE3, improve accuracy at the cost of multi-step autoregressive inference,…

Computation and Language · Computer Science 2026-01-28 Fuliang Liu , Xue Li , Ketai Zhao , Yinxi Gao , Ziyan Zhou , Zhonghui Zhang , Zhibin Wang , Wanchun Dou , Sheng Zhong , Chen Tian

Speculative decoding (SD) has proven effective for accelerating LLM inference by quickly generating draft tokens and verifying them in parallel. However, SD remains largely unexplored for Large Vision-Language Models (LVLMs), which extend…

Machine Learning · Computer Science 2026-01-29 Minjae Lee , Wonjun Kang , Byeongkeun Ahn , Christian Classen , Kevin Galim , Seunghyuk Oh , Minghao Yan , Hyung Il Koo , Kangwook Lee

Constrained decoding with lookahead heuristics (CDLH) is a highly effective method for aligning LLM generations to human preferences. However, the extensive lookahead roll-out operations for each generated token makes CDLH prohibitively…

Computation and Language · Computer Science 2025-02-12 Nishanth Nakshatri , Shamik Roy , Rajarshi Das , Suthee Chaidaroon , Leonid Boytsov , Rashmi Gangadharaiah

Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency. Speculative decoding (SD) mitigates this through a guess-and-verify strategy, but existing training-free variants face…

Computation and Language · Computer Science 2026-04-17 Zihong Zhang , Zuchao Li , Lefei Zhang , Ping Wang , Hai Zhao

Speculative decoding is a relatively new decoding framework that leverages small and efficient draft models to reduce the latency of LLMs. In this study, we introduce GliDe and CaPE, two low-hassle modifications to vanilla speculative…

Computation and Language · Computer Science 2024-02-06 Cunxiao Du , Jing Jiang , Xu Yuanchen , Jiawei Wu , Sicheng Yu , Yongqi Li , Shenggui Li , Kai Xu , Liqiang Nie , Zhaopeng Tu , Yang You

Vision-language Models (VLMs) have made significant strides in visual understanding and query response generation, but often face challenges of high computational cost and inference latency due to autoregressive decoding. In this work, we…

Machine Learning · Computer Science 2025-10-28 Divya Jyoti Bajpai , Manjesh Kumar Hanawal

Speculative decoding (SD) has emerged as a method to accelerate LLM inference without sacrificing any accuracy over the 16-bit model inference. In a typical SD setup, the idea is to use a full-precision, small, fast model as "draft" to…

Computation and Language · Computer Science 2025-03-19 Evangelos Georganas , Dhiraj Kalamkar , Alexander Kozlov , Alexander Heinecke

Large language models achieve impressive performance across diverse tasks but exhibit high inference latency due to their large parameter sizes. While quantization reduces model size, it often leads to performance degradation compared to…

Hardware Architecture · Computer Science 2025-10-22 Yushu Zhao , Yubin Qin , Yang Wang , Xiaolong Yang , Huiming Han , Shaojun Wei , Yang Hu , Shouyi Yin

Speculative decoding accelerates LLM inference by using a smaller draft model to speculate tokens that a larger target model verifies. Verification is often the bottleneck (e.g. verification is $4\times$ slower than token generation when a…

Computation and Language · Computer Science 2026-05-27 Avinash Kumar , Sujay Sanghavi , Poulami Das

Speculative decoding accelerates Large Language Models (LLMs) inference by using a lightweight draft model to propose candidate tokens that are verified in parallel by the target model. However, existing draft model training objectives are…

Computation and Language · Computer Science 2026-05-12 Zihao An , Taichi Liu , Ziqiong Liu , Dong Li , Ruofeng Liu , Emad Barsoum

Large language models~(LLMs) exhibit exceptional performance in language tasks, yet their auto-regressive inference is limited due to high computational requirements and is sub-optimal due to the exposure bias. Inspired by speculative…

Computation and Language · Computer Science 2024-03-14 Hongyi Yuan , Keming Lu , Fei Huang , Zheng Yuan , Chang Zhou

Diffusion large language models (dLLMs) generate text through iterative denoising. In commonly adopted parallel decoding schemes, each step confirms only high-confidence positions while remasking the others. By analyzing dLLM denoising…

Computation and Language · Computer Science 2026-05-27 Kangyu Wang , Zhiyun Jiang , Haibo Feng , Weijia Zhao , Lin Liu , Jianguo Li , Zhenzhong Lan , Weiyao Lin