English
Related papers

Related papers: Constrained Decoding with Speculative Lookaheads

200 papers

Accelerating inference in Large Language Models (LLMs) is critical for real-time interactions, as they have been widely incorporated into real-world services. Speculative decoding, a fully algorithmic solution, has gained attention for…

Computation and Language · Computer Science 2025-02-11 Sukmin Cho , Sangjin Choi , Taeho Hwang , Jeongyeon Seo , Soyeong Jeong , Huije Lee , Hoyun Song , Jong C. Park , Youngjin Kwon

Speculative decoding is a powerful technique that attempts to circumvent the autoregressive constraint of modern Large Language Models (LLMs). The aim of speculative decoding techniques is to improve the average inference time of a large,…

Computation and Language · Computer Science 2024-10-25 Sudhanshu Agrawal , Wonseok Jeon , Mingu Lee

Autoregressive decoding inherently limits the inference throughput of Large Language Model (LLM) due to its sequential dependency. Speculative decoding mitigates this by verifying multiple predicted tokens in parallel, but its efficiency…

Computation and Language · Computer Science 2025-10-27 Siran Liu , Yang Ye , Qianchao Zhu , Zane Cao , Yongchao He

Speculative decoding (SD) is a promising method for accelerating the decoding process of Large Language Models (LLMs). The efficiency of SD primarily hinges on the consistency between the draft model and the verify model. However, existing…

Computation and Language · Computer Science 2025-06-02 Longze Chen , Renke Shan , Huiming Wang , Lu Wang , Ziqiang Liu , Run Luo , Jiawei Wang , Hamid Alinejad-Rokny , Min Yang

Speculative decoding (SD) accelerates LLM inference by verifying draft tokens in parallel. However, this method presents a critical trade-off: it improves throughput in low-load, memory-bound systems but degrades performance in high-load,…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-04 Rui Li , Zhaoning Zhang , Libo Zhang , Huaimin Wang , Xiang Fu , Zhiquan Lai

Transformer language models generate text autoregressively, making inference latency proportional to the number of tokens generated. Speculative decoding reduces this latency without sacrificing output quality, by leveraging a small draft…

Machine Learning · Computer Science 2025-10-24 Clara Mohri , Haim Kaplan , Tal Schuster , Yishay Mansour , Amir Globerson

Test-time scaling has emerged as a powerful paradigm for enhancing the reasoning capabilities of large language models (LLMs) by allocating additional computational resources during inference. However, this paradigm is inherently…

Computation and Language · Computer Science 2025-09-08 Shengyin Sun , Yiming Li , Xing Li , Yingzhao Lian , Weizhe Lin , Hui-Ling Zhen , Zhiyuan Yang , Chen Chen , Xianzhi Yu , Mingxuan Yuan , Chen Ma

Diffusion-based Large Language Models (dLLMs) have emerged as a competitive alternative to autoregressive models, offering unique advantages through bidirectional attention and parallel generation paradigms. However, the generation results…

Computation and Language · Computer Science 2025-10-07 Yifeng Gao , Ziang Ji , Yuxuan Wang , Biqing Qi , Hanlin Xu , Linfeng Zhang

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 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 is a powerful way to accelerate autoregressive large language models (LLMs), but directly porting it to vision-language models (VLMs) faces unique systems constraints: the prefill stage is dominated by visual tokens…

Computer Vision and Pattern Recognition · Computer Science 2025-09-23 Haiduo Huang , Fuwei Yang , Zhenhua Liu , Xuanwu Yin , Dong Li , Pengju Ren , Emad Barsoum

Diffusion Large Language Models (dLLMs) have demonstrated promising generative capabilities and are increasingly used to produce formal languages defined by context-free grammars, such as source code and chemical expressions. However, as…

Computation and Language · Computer Science 2026-02-10 Yitong Zhang , Yongmin Li , Yuetong Liu , Jia Li , Xiaoran Jia , Zherui Li , Ge Li

Speculative Decoding (SD) is a recently proposed technique for faster inference using Large Language Models (LLMs). SD operates by using a smaller draft LLM for autoregressively generating a sequence of tokens and a larger target LLM for…

Machine Learning · Computer Science 2025-07-09 Meiyu Zhong , Noel Teku , Ravi Tandon

Speculative decoding (SD) has emerged as a powerful method for accelerating autoregressive generation in large language models (LLMs), yet its integration into vision-language models (VLMs) remains underexplored. We introduce DREAM, a novel…

Computation and Language · Computer Science 2025-10-24 Yunhai Hu , Tianhua Xia , Zining Liu , Rahul Raman , Xingyu Liu , Bo Bao , Eric Sather , Vithursan Thangarasa , Sai Qian Zhang

Speculative decoding accelerates LLM inference by letting a small drafter propose multiple tokens which a large target model verifies once per speculation step. As vocabularies scale past 10e5 tokens,verification cost in the target model is…

Computation and Language · Computer Science 2026-02-04 Jinbin Zhang , Nasib Ullah , Erik Schultheis , Rohit Babbar

Speculative decoding accelerates autoregressive generation by separating token proposal from verification, but most existing approaches are designed for single-node execution and do not scale well to multi-accelerator clusters used for…

Systems and Control · Electrical Eng. & Systems 2026-01-30 Junhao He , Feiran You , Hongyang Du

We present a novel inference scheme, self-speculative decoding, for accelerating Large Language Models (LLMs) without the need for an auxiliary model. This approach is characterized by a two-stage process: drafting and verification. The…

Computation and Language · Computer Science 2025-02-11 Jun Zhang , Jue Wang , Huan Li , Lidan Shou , Ke Chen , Gang Chen , Sharad Mehrotra

Speculative decoding (SD) accelerates large language model (LLM) inference by using a smaller model to draft future tokens, which are then verified by the target LLM. This preserves generation quality by accepting only aligned tokens.…

Computation and Language · Computer Science 2026-04-08 Taehyeon Kim , Hojung Jung , Se-Young Yun

Diffusion Language Models (DLMs) have recently achieved significant success due to their any-order generation capabilities. However, existing inference methods typically rely on local, immediate-step metrics such as confidence or entropy…

Computation and Language · Computer Science 2025-12-03 Kecheng Chen , Ziru Liu , Xijia Tao , Hui Liu , Xinyu Fu , Suiyun Zhang , Dandan Tu , Lingpeng Kong , Rui Liu , Haoliang Li

Speculative decoding (SD) has emerged as an effective technique to accelerate large language model (LLM) inference without compromising output quality. However, the achievable speedup largely depends on the effectiveness of the drafting…

Computation and Language · Computer Science 2025-11-04 Min Fang , Zhihui Fu , Qibin Zhao , Jun Wang