English
Related papers

Related papers: Decoding Speculative Decoding

200 papers

Diffusion Large Language Models (dLLMs) offer fast, parallel token generation, but their standalone use is plagued by an inherent efficiency-quality tradeoff. We show that, if carefully applied, the attributes of dLLMs can actually be a…

Machine Learning · Computer Science 2026-01-29 Rui Pan , Zhuofu Chen , Hongyi Liu , Arvind Krishnamurthy , Ravi Netravali

Speculative decoding is a standard method for accelerating the inference speed of large language models. However, scaling it for production environments poses several engineering challenges, including efficiently implementing different…

The emergence of long-context large language models (LLMs) offers a promising alternative to traditional retrieval-augmented generation (RAG) for processing extensive documents. However, the computational overhead of long-context inference…

Computation and Language · Computer Science 2025-06-24 Guanzheng Chen , Qilong Feng , Jinjie Ni , Xin Li , Michael Qizhe Shieh

Large Language Models (LLMs) present a critical trade-off between inference quality and computational cost: larger models offer superior capabilities but incur significant latency, while smaller models are faster but less powerful. Existing…

Machine Learning · Computer Science 2025-05-13 Hang Wu , Jianian Zhu , Yinghui Li , Haojie Wang , Biao Hou , Jidong Zhai

The practice of speculative decoding, whereby inference is probabilistically supported by a smaller, cheaper, ``drafter'' model, has become a standard technique for systematically reducing the decoding time of large language models. This…

Computation and Language · Computer Science 2025-10-03 Jameson Sandler , Ahmet Üstün , Marco Romanelli , Sara Hooker , Ferdinando Fioretto

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

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 (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

Autoregressive sampling from large language models has led to state-of-the-art results in several natural language tasks. However, autoregressive sampling generates tokens one at a time making it slow, and even prohibitive in certain tasks.…

Machine Learning · Computer Science 2024-01-19 Ziteng Sun , Ananda Theertha Suresh , Jae Hun Ro , Ahmad Beirami , Himanshu Jain , Felix Yu

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 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

Speculative decoding (SD) has emerged as a widely used paradigm to accelerate LLM inference without compromising quality. It works by first employing a compact model to draft multiple tokens efficiently and then using the target LLM to…

Computation and Language · Computer Science 2025-03-07 Heming Xia , Yongqi Li , Jun Zhang , Cunxiao Du , Wenjie Li

Large language models (LLMs) achieve strong performance across diverse tasks but suffer from high inference latency due to their autoregressive generation. Speculative Decoding (SPD) mitigates this issue by verifying candidate tokens in…

Computation and Language · Computer Science 2026-04-30 Jinze Li , Yixing Xu , Guanchen Li , Shuo Yang , Jinfeng Xu , Xuanwu Yin , Dong Li , Edith C. H. Ngai , Emad Barsoum

RL post-training of frontier language models is increasingly bottlenecked by autoregressive rollout generation, making rollout acceleration a central systems challenge. Many existing efficiency methods improve throughput by changing the…

Self-speculative decoding is an inference technique for large language models designed to speed up generation without sacrificing output quality. It combines fast, approximate decoding using a compact version of the model as a draft model…

Machine Learning · Computer Science 2026-04-17 Walaa Amer , Uday das , Fadi Kurdahi

As the usage of large language models (LLMs) grows, performing efficient inference with these models becomes increasingly important. While speculative decoding has recently emerged as a promising direction for speeding up inference,…

Computation and Language · Computer Science 2025-07-08 Zhuoming Chen , Avner May , Ruslan Svirschevski , Yuhsun Huang , Max Ryabinin , Zhihao Jia , Beidi Chen

Speculative decoding accelerates LLM inference by using a draft model to look ahead, but gains are capped by the cost of autoregressive draft generation: increasing draft size elevates acceptance rates but introduces additional latency…

Computation and Language · Computer Science 2025-12-15 Nikhil Bhendawade , Kumari Nishu , Arnav Kundu , Chris Bartels , Minsik Cho , Irina Belousova

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 (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

The acceleration of Large Language Models (LLMs) with speculative decoding provides a significant runtime improvement without any loss of accuracy. Currently, EAGLE-2 is the state-of-the-art speculative decoding method, improving on EAGLE…

Computation and Language · Computer Science 2024-09-04 Oscar Brown , Zhengjie Wang , Andrea Do , Nikhil Mathew , Cheng Yu
‹ Prev 1 3 4 5 6 7 10 Next ›