English
Related papers

Related papers: Speculative Sampling via Exponential Races

200 papers

Speculative decoding is commonly used for reducing the inference latency of large language models. Its effectiveness depends highly on the speculation lookahead (SL)-the number of tokens generated by the draft model at each iteration. In…

Computation and Language · Computer Science 2024-11-08 Jonathan Mamou , Oren Pereg , Daniel Korat , Moshe Berchansky , Nadav Timor , Moshe Wasserblat , Roy Schwartz

Speculative decoding (SD) has been demonstrated as an effective technique for lossless LLM inference acceleration. Retrieval-based SD methods, one kind of model-free method, have yielded promising speedup, but they often rely on incomplete…

Computation and Language · Computer Science 2024-12-17 Yuxuan Hu , Ke Wang , Xiaokang Zhang , Fanjin Zhang , Cuiping Li , Hong Chen , Jing Zhang

Speculative sampling has emerged as an important technique for accelerating the auto-regressive generation process of large language models (LLMs) by utilizing a draft-then-verify mechanism to produce multiple tokens per forward pass. While…

Computation and Language · Computer Science 2025-03-12 Weilin Zhao , Tengyu Pan , Xu Han , Yudi Zhang , Ao Sun , Yuxiang Huang , Kaihuo Zhang , Weilun Zhao , Yuxuan Li , Jianyong Wang , Zhiyuan Liu , Maosong Sun

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), where a draft model provides multiple candidate tokens for the target model to verify in parallel, has demonstrated significant potential for accelerating LLM inference. Yet, existing SD approaches adhere to a…

Machine Learning · Computer Science 2025-09-22 Enyu Zhou , Kai Sheng , Hao Chen , Xin He

Inference with Multimodal Large Language Models (MLLMs) is slow due to their large-language-model backbone which suffers from memory bandwidth bottleneck and generates tokens auto-regressively. In this paper, we explore the application of…

Computation and Language · Computer Science 2024-04-16 Mukul Gagrani , Raghavv Goel , Wonseok Jeon , Junyoung Park , Mingu Lee , Christopher Lott

End-to-end automatic speech recognition (ASR) systems based on transformer architectures, such as Whisper, offer high transcription accuracy and robustness. However, their autoregressive decoding is computationally expensive, hence limiting…

Computation and Language · Computer Science 2025-07-30 Tuan Vu Ho , Hiroaki Kokubo , Masaaki Yamamoto , Yohei Kawaguchi

Striking an optimal balance between minimal drafting latency and high speculation accuracy to enhance the inference speed of Large Language Models remains a significant challenge in speculative decoding. In this paper, we introduce Falcon,…

Computation and Language · Computer Science 2025-04-23 Xiangxiang Gao , Weisheng Xie , Yiwei Xiang , Feng Ji

Introduced to enhance the efficiency of large language model (LLM) inference, speculative decoding operates by having a smaller model generate a draft. A larger target model then reviews this draft to align with its output, and any…

Machine Learning · Computer Science 2025-07-15 Ziyi Chen , Xiaocong Yang , Jiacheng Lin , Chenkai Sun , Kevin Chen-Chuan Chang , Jie Huang

Large language models (LLMs) exhibit exceptional performance across a wide range of tasks; however, their token-by-token autoregressive generation process significantly hinders inference speed. Speculative decoding presents a promising…

Computation and Language · Computer Science 2025-03-04 Kai Lv , Honglin Guo , Qipeng Guo , Xipeng Qiu

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

Speculative Decoding (SD) is a key technique for accelerating Large Language Model (LLM) inference, but it typically requires training a draft model on a large dataset. We approach this problem from a data-centric perspective, finding that…

Computation and Language · Computer Science 2026-02-19 Jiaming Fan , Daming Cao , Xiangzhong Luo , Jiale Fu , Chonghan Liu , Xu Yang

Speculative decoding accelerates large language model (LLM) inference by using a small draft model to generate candidate tokens for a larger target model to verify. The efficacy of this technique hinges on the trade-off between the time…

Computation and Language · Computer Science 2026-03-03 Jiebin Zhang , Zhenghan Yu , Liang Wang , Nan Yang , Eugene J. Yu , Zheng Li , Yifan Song , Dawei Zhu , Xingxing Zhang , Furu Wei , Sujian Li

Speculative decoding (SD) has been shown to reduce the latency of autoregressive decoding (AD) by 2-3x for small batch sizes. However, increasing throughput and therefore reducing the cost per token requires decoding with large batch sizes.…

Machine Learning · Computer Science 2025-04-10 Sanjit Neelam , Daniel Heinlein , Vaclav Cvicek , Akshay Mishra , Reiner Pope

Speculative decoding (SD), where a small draft model is employed to propose draft tokens in advance and then the target model validates them in parallel, has emerged as a promising technique for LLM inference acceleration. Many endeavors to…

Computation and Language · Computer Science 2026-04-30 Tianyu Liu , Qitan Lv , Hao Li , Xing Gao , Xiao Sun , Xiaoyan Sun

Speculative decoding accelerates LLMs by using a lightweight draft model to generate tokens autoregressively before verifying them in parallel with a larger target model. However, determining the optimal number of tokens to draft remains a…

Machine Learning · Computer Science 2025-11-05 Aditya Sridhar , Nish Sinnadurai , Sean Lie , Vithursan Thangarasa

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

Large language models typically generate tokens autoregressively, using each token as input for the next. Recent work on Speculative Decoding has sought to accelerate this process by employing a smaller, faster draft model to more quickly…

Computation and Language · Computer Science 2024-10-24 Bradley McDanel

Speculative Decoding has gained popularity as an effective technique for accelerating the auto-regressive inference process of Large Language Models. However, Speculative Decoding entirely relies on the availability of efficient draft…

Computation and Language · Computer Science 2025-06-06 Ofir Zafrir , Igor Margulis , Dorin Shteyman , Shira Guskin , Guy Boudoukh

Speculative decoding (SPD) accelerates large language model (LLM) inference by letting a smaller draft model propose multiple future tokens that are verified in parallel by a larger target model. The dominant SPD paradigm treats the target…

Computation and Language · Computer Science 2026-05-26 Jinze Li , Yixing Xu , Guanchen Li , Jinfeng Xu , Shuo Yang , Yang Zhang , Xuanwu Yin , Dong Li , Edith C. H. Ngai , Emad Barsoum
‹ Prev 1 3 4 5 6 7 10 Next ›