English
Related papers

Related papers: SpecFLASH: A Latent-Guided Semi-autoregressive Spe…

200 papers

Large language models (LLMs) have become ubiquitous in practice and are widely used for generation tasks such as translation, summarization and instruction following. However, their enormous size and reliance on autoregressive decoding…

Machine Learning · Computer Science 2024-07-18 Benjamin Bergner , Andrii Skliar , Amelie Royer , Tijmen Blankevoort , Yuki Asano , Babak Ehteshami Bejnordi

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

The recent advancements in large language models (LLMs) have been extraordinary, yet the escalating inference costs associated with them present challenges in real-world applications. To address these challenges, we propose a novel approach…

Computation and Language · Computer Science 2024-06-07 Jiahao Liu , Qifan Wang , Jingang Wang , Xunliang Cai

Large Language Model (LLM) collaborative decoding techniques improve output quality by combining the outputs of multiple models at each generation step, but they incur high computational costs. In this paper, we introduce Collaborative…

Computation and Language · Computer Science 2025-05-30 Jiale Fu , Yuchu Jiang , Junkai Chen , Jiaming Fan , Xin Geng , Xu Yang

Large language models achieve strong machine translation quality but incur high inference cost and latency, posing challenges for simultaneous translation. Re-translation provides a practical solution for off-the-shelf LLMs by repeatedly…

Computation and Language · Computer Science 2026-01-06 Linxiao Zeng , Haoyun Deng , Kangyuan Shu , Shizhen Wang

Text generation with Large Language Models (LLMs) is known to be memory bound due to the combination of their auto-regressive nature, huge parameter counts, and limited memory bandwidths, often resulting in low token rates. Speculative…

Machine Learning · Computer Science 2024-05-15 Raghavv Goel , Mukul Gagrani , Wonseok Jeon , Junyoung Park , Mingu Lee , Christopher Lott

We present speculative sampling, an algorithm for accelerating transformer decoding by enabling the generation of multiple tokens from each transformer call. Our algorithm relies on the observation that the latency of parallel scoring of…

Computation and Language · Computer Science 2023-02-03 Charlie Chen , Sebastian Borgeaud , Geoffrey Irving , Jean-Baptiste Lespiau , Laurent Sifre , John Jumper

LLM serving platforms are increasingly deployed as multi-model cloud systems, where user demand is often long-tailed: a few popular large models receive most requests, while many smaller tail models remain underutilized. We propose…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-13 Jincheng Xie , Yawen Ling , Qi Xiao , Feiyu Zhang , Zhongyi Huang , Wen Hu , Yu Zheng

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

Large language model (LLM)-based generative list-wise recommendation has advanced rapidly, but decoding remains sequential and thus latency-prone. To accelerate inference without changing the target distribution, speculative decoding (SD)…

Information Retrieval · Computer Science 2026-05-01 Jiaju Chen , Chongming Gao , Chenxiao Fan , Haoyan Liu , Qingpeng Cai , Peng Jiang , Xiangnan He

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

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 technique that uses multiple language models to accelerate infer- ence. Previous works have used an experi- mental approach to optimize the throughput of the inference pipeline, which involves LLM training and can…

Computation and Language · Computer Science 2026-03-13 Amirhossein Bozorgkhoo , Igor Molybog

Improving time-to-first-token (TTFT) is an essentially important objective in modern large language model (LLM) inference engines. Optimizing TTFT directly results in higher maximal QPS and meets the requirements of many critical…

Computation and Language · Computer Science 2025-05-21 Jingyu Liu , Beidi Chen , Ce Zhang

We present Recurrent Drafter (ReDrafter), an advanced speculative decoding approach that achieves state-of-the-art speedup for large language models (LLMs) inference. The performance gains are driven by three key aspects: (1) leveraging a…

Computation and Language · Computer Science 2024-12-17 Yunfei Cheng , Aonan Zhang , Xuanyu Zhang , Chong Wang , Yi Wang

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

Speculative decoding is a widely used method that accelerates the generation process of large language models (LLMs) with no compromise in model performance. It achieves this goal by using an existing smaller model for drafting and then…

Computation and Language · Computer Science 2024-10-16 Weilin Zhao , Yuxiang Huang , Xu Han , Wang Xu , Chaojun Xiao , Xinrong Zhang , Yewei Fang , Kaihuo Zhang , Zhiyuan Liu , Maosong Sun

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

Diffusion LLMs (dLLMs) have recently emerged as a powerful alternative to autoregressive LLMs (AR-LLMs) with the potential to operate at significantly higher token generation rates. However, currently available open-source dLLMs often…

Machine Learning · Computer Science 2026-01-15 Sudhanshu Agrawal , Risheek Garrepalli , Raghavv Goel , Mingu Lee , Christopher Lott , Fatih Porikli

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