English
Related papers

Related papers: S2D: Sorted Speculative Decoding For More Efficien…

200 papers

Speculative decoding accelerates Large Language Model (LLM) inference by verifying multiple drafted tokens in parallel. However, for Mixture-of-Experts (MoE) models, this parallelism introduces a severe bottleneck: large draft trees…

Machine Learning · Computer Science 2026-02-19 Bradley McDanel , Steven Li , Sruthikesh Surineni , Harshit Khaitan

With the increasingly giant scales of (causal) large language models (LLMs), the inference efficiency comes as one of the core concerns along the improved performance. In contrast to the memory footprint, the latency bottleneck seems to be…

Computation and Language · Computer Science 2024-04-24 Chen Zhang , Zhuorui Liu , Dawei Song

The rapid advancement of large language models (LLMs) has revolutionized code generation tasks across various programming languages. However, the unique characteristics of programming languages, particularly those like Verilog with specific…

Machine Learning · Computer Science 2025-03-19 Changran Xu , Yi Liu , Yunhao Zhou , Shan Huang , Ningyi Xu , Qiang Xu

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…

Speculative decoding (SD) has attracted a significant amount of research attention due to the substantial speedup it can achieve for LLM inference. However, despite the high speedups they offer, speculative decoding methods often achieve…

Computation and Language · Computer Science 2024-06-04 Wei Zhong , Manasa Bharadwaj

Speculative decoding accelerates memory-bound LLM inference without quality degradation by using a fast drafter to propose multiple candidate tokens and the target model to verify them in parallel. However, conventional sequential…

Computation and Language · Computer Science 2026-05-20 Yaojie Zhang , Jianuo Huang , Junlong Ke , Yuhang Han , Yongji Long , Tianchen Zhao , Biqing Qi , Linfeng Zhang

Scaling the size of language models to tens of billions of parameters has led to impressive performance on a wide range of tasks. At generation, these models are used auto-regressively, requiring a forward pass for each generated token, and…

Computation and Language · Computer Science 2023-11-23 Giovanni Monea , Armand Joulin , Edouard Grave

Autoregressive next token prediction language models offer powerful capabilities but face significant challenges in practical deployment due to the high computational and memory costs of inference, particularly during the decoding stage. We…

We propose Speculative Decoding (SpecDec), for the first time ever, to formally study exploiting the idea of speculative execution to accelerate autoregressive (AR) decoding. Speculative Decoding has two innovations: Spec-Drafter -- an…

Computation and Language · Computer Science 2023-10-31 Heming Xia , Tao Ge , Peiyi Wang , Si-Qing Chen , Furu Wei , Zhifang Sui

Speculative generation has emerged as a promising technique to accelerate inference in large language models (LLMs) by leveraging parallelism to verify multiple draft tokens simultaneously. However, the fundamental limits on the achievable…

Computation and Language · Computer Science 2025-12-15 Sergey Pankratov , Dan Alistarh

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

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 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 powerful technique for accelerating the inference process of large language models (LLMs) without sacrificing accuracy. Typically, SD employs a small draft model to generate a fixed number of draft tokens,…

Computation and Language · Computer Science 2026-02-03 Situo Zhang , Yifan Zhang , Zichen Zhu , Hankun Wang , Da Ma , Danyang Zhang , Lu Chen , Kai Yu

Large language models (LLMs) have achieved impressive results on multi-step mathematical reasoning, yet at the cost of high computational overhead. This challenge is particularly acute for test-time scaling methods such as parallel…

Machine Learning · Computer Science 2026-03-24 Yuanlin Chu , Bo Wang , Xiang Liu , Hong Chen , Aiwei Liu , Xuming Hu

Scaling test-time compute has driven the recent advances in the reasoning capabilities of large language models (LLMs), typically by allocating additional computation for more thorough exploration. However, increased compute often comes at…

Artificial Intelligence · Computer Science 2026-02-20 Mert Cemri , Nived Rajaraman , Rishabh Tiwari , Xiaoxuan Liu , Kurt Keutzer , Ion Stoica , Kannan Ramchandran , Ahmad Beirami , Ziteng Sun

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

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

Growing demands from tasks like code generation, deep reasoning, and long-document understanding have made long-context generation a crucial capability for large language models (LLMs). Speculative decoding is one of the most direct and…

Machine Learning · Computer Science 2025-12-03 Zhendong Tan , Xingjun Zhang , Chaoyi Hu , Junjie Peng , Kun Xia

Large language models (LLMs) are increasingly used for long-content generation (e.g., long Chain-of-Thought reasoning) where decoding efficiency becomes a critical bottleneck: Autoregressive decoding is inherently limited by its sequential…

Computation and Language · Computer Science 2025-06-05 Zhepei Wei , Wei-Lin Chen , Xinyu Zhu , Yu Meng
‹ Prev 1 8 9 10 Next ›