English
Related papers

Related papers: TapOut: A Bandit-Based Approach to Dynamic Specula…

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

Speculative decoding accelerates LLM inference by drafting a tree of candidate continuations and verifying it in one target forward. Existing drafters fall into two camps with opposite weaknesses. Autoregressive drafters such as EAGLE-3…

Computation and Language · Computer Science 2026-05-22 Weijie Shi , Qiang Xu , Fan Deng , Yaguang Wu , Jiarun Liu , Yehong Xu , Hao Chen , Jia Zhu , Jiajie Xu , Xiangjun Huang , Jian Yang , Xiaofang Zhou

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

Large language models increasingly use external tools such as web search and document retrieval to solve information-intensive tasks. However, multi-hop tool use in complex tasks introduces substantial latency, since the model must…

Computation and Language · Computer Science 2026-05-22 Mehrdad Saberi , Keivan Rezaei , Soheil Feizi

We formulate a multi-armed bandit (MAB) approach to choosing expert policies online in Markov decision processes (MDPs). Given a set of expert policies trained on a state and action space, the goal is to maximize the cumulative reward of…

Systems and Control · Computer Science 2017-07-19 Eric Mazumdar , Roy Dong , Vicenç Rúbies Royo , Claire Tomlin , S. Shankar Sastry

Transformer-based autoregressive sampling has been the major bottleneck for slowing down large language model inferences. One effective way to accelerate inference is \emph{Speculative Decoding}, which employs a small model to sample a…

Machine Learning · Computer Science 2024-11-05 Ming Yin , Minshuo Chen , Kaixuan Huang , Mengdi Wang

Speculative decoding has demonstrated its effectiveness in accelerating the inference of large language models while maintaining a consistent sampling distribution. However, the conventional approach of training a separate draft model to…

Computation and Language · Computer Science 2024-04-30 Fangcheng Liu , Yehui Tang , Zhenhua Liu , Yunsheng Ni , Kai Han , Yunhe Wang

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

The demand for large language model inference is rapidly increasing. Pipeline parallelism offers a cost-effective deployment strategy for distributed inference but suffers from high service latency. While incorporating speculative decoding…

Machine Learning · Computer Science 2025-09-01 Haofei Yin , Mengbai Xiao , Tinghong Li , Xiao Zhang , Dongxiao Yu , Guanghui Zhang

As large language models (LLMs) scale up, accuracy improves, but the autoregressive (AR) nature of decoding increases latency since each token requires a serial forward pass. Speculative decoding addresses this by employing a fast drafter…

Computation and Language · Computer Science 2025-10-06 Guanghao Li , Zhihui Fu , Min Fang , Qibin Zhao , Ming Tang , Chun Yuan , Jun Wang

Speculative decoding is an effective technique for accelerating large language model inference by drafting multiple tokens in parallel. In practice, its speedup is often bottlenecked by a rigid verification step that strictly enforces the…

Computation and Language · Computer Science 2026-04-10 Ziyi Wang , Siva Rajesh Kasa , Ankith M S , Santhosh Kumar Kasa , Jiaru Zou , Sumit Negi , Ruqi Zhang , Nan Jiang , Qifan Song

Recent works have revealed the great potential of speculative decoding in accelerating the autoregressive generation process of large language models. The success of these methods relies on the alignment between draft candidates and the…

Computation and Language · Computer Science 2025-09-15 Jikai Wang , Zhenxu Tian , Juntao Li , Qingrong Xia , Xinyu Duan , Zhefeng Wang , Baoxing Huai , Min Zhang

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

Inference with modern Large Language Models (LLMs) is expensive and slow, and speculative sampling has emerged as an effective solution to this problem, however, the number of the calls to the draft model for generating candidate tokens in…

Artificial Intelligence · Computer Science 2025-12-17 Junjie Ma , Jinlong Li

Inference latency stands as a critical bottleneck in the large-scale deployment of Large Language Models (LLMs). Speculative decoding methods have recently shown promise in accelerating inference without compromising the output…

Machine Learning · Computer Science 2025-10-31 Ruilin Wang , Huixia Li , Yuexiao Ma , Xiawu Zheng , Fei Chao , Xuefeng Xiao , Rongrong Ji

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

Thompson Sampling is one of the oldest heuristics for multi-armed bandit problems. It is a randomized algorithm based on Bayesian ideas, and has recently generated significant interest after several studies demonstrated it to have better…

Machine Learning · Computer Science 2014-02-04 Shipra Agrawal , Navin Goyal

Despite their strong performance on reasoning tasks, large reasoning models (LRMs) often suffer from overthinking, producing unnecessarily long outputs and incurring high end-to-end latency, a significant limitation to their real-world…

Artificial Intelligence · Computer Science 2025-10-22 Rubing Yang , Huajun Bai , Song Liu , Guanghua Yu , Runzhi Fan , Yanbin Dang , Jiejing Zhang , Kai Liu , Jianchen Zhu , Peng Chen

Speculative decoding (SD) has emerged as a method to accelerate LLM inference without sacrificing any accuracy over the 16-bit model inference. In a typical SD setup, the idea is to use a full-precision, small, fast model as "draft" to…

Computation and Language · Computer Science 2025-03-19 Evangelos Georganas , Dhiraj Kalamkar , Alexander Kozlov , Alexander Heinecke

Speculative Decoding (SD) accelerates autoregressive large language model (LLM) inference by decoupling generation and verification. While recent methods improve draft quality by tightly coupling the drafter with the target model, the…

Machine Learning · Computer Science 2026-04-14 Jingwei Song , Xinyu Wang , Hanbin Wang , Xiaoxuan Lei , Bill Shi , Shixin Han , Eric Yang , Xiao-Wen Chang , Lynn Ai