English
Related papers

Related papers: $\texttt{SPECS}$: Faster Test-Time Scaling through…

200 papers

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

The performance of large language models (LLMs) is closely linked to their underlying size, leading to ever-growing networks and hence slower inference. Speculative decoding has been proposed as a technique to accelerate autoregressive…

One critical challenge for large language models (LLMs) for making complex reasoning is their reliance on matching reasoning patterns from training data, instead of proactively selecting the most appropriate cognitive strategy to solve a…

Computation and Language · Computer Science 2025-03-18 Qin Liu , Wenxuan Zhou , Nan Xu , James Y. Huang , Fei Wang , Sheng Zhang , Hoifung Poon , Muhao Chen

Early exiting has recently emerged as a promising technique for accelerating large language models (LLMs) by effectively reducing the hardware computation and memory access. In this paper, we present SpecEE, a fast LLM inference engine with…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-15 Jiaming Xu , Jiayi Pan , Yongkang Zhou , Siming Chen , Jinhao Li , Yaoxiu Lian , Junyi Wu , Guohao Dai

Speculative decoding reduces the inference latency of a target large language model via utilizing a smaller and faster draft model. Its performance depends on a hyperparameter K -- the candidate length, i.e., the number of candidate tokens…

Computation and Language · Computer Science 2025-07-14 Kaixuan Huang , Xudong Guo , Mengdi Wang

Test-time scaling (TTS) -- the dynamic allocation of compute during inference -- is a promising direction for improving reasoning in large language models (LLMs). However, a systematic comparison of well-known TTS strategies under identical…

Computation and Language · Computer Science 2025-12-02 Aradhye Agarwal , Ayan Sengupta , Tanmoy Chakraborty

The growing gap between the increasing complexity of large language models (LLMs) and the limited computational budgets of edge devices poses a key challenge for efficient on-device inference, despite gradual improvements in hardware…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-06 Xiangchen Li , Dimitrios Spatharakis , Saeid Ghafouri , Jiakun Fan , Hans Vandierendonck , Deepu John , Bo Ji , Dimitrios Nikolopoulos

Large Language Models (LLMs) have become widely used for Software Engineering (SE) tasks, spanning from function-level code generation to complex repository-level workflows. However, the high latency of autoregressive inference remains a…

Software Engineering · Computer Science 2026-05-05 Yijia Li , Junkai Chen , Xing Hu , Xin Xia

With this paper, we survey techniques for improving the predictive accuracy of pretrained large language models by allocating additional compute at inference time. In categorizing test-time scaling methods, we place special emphasis on how…

Computation and Language · Computer Science 2025-11-20 Zhuoyi Yang , Xu Guo , Tong Zhang , Huijuan Xu , Boyang Li

Deployment of autoregressive large language models (LLMs) is costly, and as these models increase in size, the associated costs will become even more considerable. Consequently, different methods have been proposed to accelerate the token…

Computation and Language · Computer Science 2024-07-03 Parsa Kavehzadeh , Mohammadreza Pourreza , Mojtaba Valipour , Tinashu Zhu , Haoli Bai , Ali Ghodsi , Boxing Chen , Mehdi Rezagholizadeh

Large language models (LLMs) underpin interactive multimedia applications such as captioning, retrieval, recommendation, and creative content generation, yet their autoregressive decoding incurs substantial latency. Speculative decoding…

Artificial Intelligence · Computer Science 2026-02-06 Hanyu Wei , Zunhai Su , Peng Lu , Chao Li , Spandan Tiwari , Ashish Sirasao , Yuhan Dong

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

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

Adapting large language models (LLMs) via reinforcement learning (RL) is often bottlenecked by the generation stage, which can consume over 75\% of the training time. Speculative decoding (SD) accelerates autoregressive generation in…

Machine Learning · Computer Science 2025-10-31 Qiaoling Chen , Zijun Liu , Peng Sun , Shenggui Li , Guoteng Wang , Ziming Liu , Yonggang Wen , Siyuan Feng , Tianwei Zhang

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

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

Large language models (LLMs) have achieved remarkable performance across a wide range of tasks, but their increasing parameter sizes significantly slow down inference. Speculative decoding mitigates this issue by leveraging a smaller draft…

Computation and Language · Computer Science 2026-05-27 Kuan-Wei Lu , Ding-Yong Hong , Pangfeng Liu , Jan-Jan Wu

Speculative decoding has rapidly emerged as a leading approach for accelerating language model (LM) inference, as it offers substantial speedups while yielding identical outputs. This relies upon a small draft model, tasked with predicting…

Computation and Language · Computer Science 2026-02-17 Miles Williams , Young D. Kwon , Rui Li , Alexandros Kouris , Stylianos I. Venieris

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