English
Related papers

Related papers: LayerSkip: Enabling Early Exit Inference and Self-…

200 papers

Speculative decoding has emerged as a promising lossless approach for accelerating Large Language Models (LLMs). As reasoning LLMs increasingly suffer from decode-stage overhead and approximation-based methods degrade accuracy, lossless…

Hardware Architecture · Computer Science 2026-05-27 Soongyu Choi , Yuntae Kim , Muyoung Son , Joo-Young Kim

The growing demand for on-device large language model (LLM) inference highlights the need for efficient mobile edge computing (MEC) solutions, especially in resource-constrained settings. Speculative decoding offers a promising solution by…

Machine Learning · Computer Science 2025-12-01 Jungyeon Koh , Hyun Jong Yang

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 is a pivotal technique to accelerate the inference of large language models (LLMs) by employing a smaller draft model to predict the target model's outputs. However, its efficacy can be limited due to the low predictive…

Artificial Intelligence · Computer Science 2024-06-11 Xiaoxuan Liu , Lanxiang Hu , Peter Bailis , Alvin Cheung , Zhijie Deng , Ion Stoica , Hao Zhang

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…

Large language model (LLM) inference at the network edge is a promising serving paradigm that leverages distributed edge resources to run inference near users and enhance privacy. Existing edge-based LLM inference systems typically adopt…

Systems and Control · Electrical Eng. & Systems 2025-10-14 Bingjie Zhu , Zhixiong Chen , Liqiang Zhao , Hyundong Shin , Arumugam Nallanathan

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

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

Interleaved spoken language models (SLMs) alternately generate text and speech tokens, but decoding at full transformer depth for every step becomes costly, especially due to long speech sequences. We propose SPAR-K, a modality-aware early…

Computation and Language · Computer Science 2026-03-11 Hsiao-Ying Huang , Cheng-Han Chiang , Hung-yi Lee

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

Recent advances in inference-time compute have significantly improved performance on complex tasks by generating long chains of thought (CoTs) using Large Reasoning Models (LRMs). However, this improved accuracy comes at the cost of high…

Machine Learning · Computer Science 2025-05-20 Rui Pan , Yinwei Dai , Zhihao Zhang , Gabriele Oliaro , Zhihao Jia , Ravi Netravali

We propose LLMA, an LLM accelerator to losslessly speed up Large Language Model (LLM) inference with references. LLMA is motivated by the observation that there are abundant identical text spans between the decoding result by an LLM and the…

Computation and Language · Computer Science 2023-04-11 Nan Yang , Tao Ge , Liang Wang , Binxing Jiao , Daxin Jiang , Linjun Yang , Rangan Majumder , Furu Wei

Scaling LLM vocabulary is often used to reduce input sequence length and alleviate attention's quadratic cost. Yet, current LLM architectures impose a critical bottleneck to this procedure: the output projection layer scales linearly with…

Computation and Language · Computer Science 2025-07-23 Amit Ben-Artzy , Roy Schwartz

Vision-language models (VLMs) achieve strong performance on multimodal tasks but suffer from high inference latency due to large model sizes and long multimodal contexts. Speculative decoding has recently emerged as an effective…

Computer Vision and Pattern Recognition · Computer Science 2026-03-17 Hui Shen , Xin Wang , Ping Zhang , Yunta Hsieh , Qi Han , Zhongwei Wan , Ziheng Zhang , Jingxuan Zhang , Jing Xiong , Ziyuan Liu , Yifan Zhang , Hangrui Cao , Chenyang Zhao , Mi Zhang

We introduce GateSkip, a simple residual-stream gating mechanism that enables token-wise layer skipping in decoder-only LMs. Each Attention/MLP branch is equipped with a sigmoid-linear gate that condenses the branch's output before it…

Computation and Language · Computer Science 2026-02-10 Filipe Laitenberger , Dawid Kopiczko , Cees G. M. Snoek , Yuki M. Asano

Autoregressive large language models (LLMs) are bottlenecked by sequential decoding, where each new token typically requires executing all transformer layers. Existing dynamic-depth and layer-skipping methods reduce this cost, but often…

Computation and Language · Computer Science 2026-01-07 Hossein Rajabzadeh , Maryam Dialameh , Chul B. Park , Il-Min Kim , Hyock Ju Kwon

Large reasoning models achieve strong performance on complex tasks by generating extended chains of thought, but they often "overthink": continuing to reason long after they have enough information to answer correctly. This wastes…

Computation and Language · Computer Science 2025-12-08 Ömer Faruk Akgül , Yusuf Hakan Kalaycı , Rajgopal Kannan , Willie Neiswanger , Viktor Prasanna

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

Chain-of-Thought (CoT) has been proven effective in enhancing the reasoning capabilities of large language models (LLMs). Recent advancements, such as OpenAI's o1 and DeepSeek-R1, suggest that scaling up the length of CoT sequences during…

Computation and Language · Computer Science 2025-09-17 Heming Xia , Chak Tou Leong , Wenjie Wang , Yongqi Li , Wenjie Li

Large Language Models (LLMs) demonstrate remarkable emergent abilities across various tasks, yet fall short of complex reasoning and planning tasks. The tree-search-based reasoning methods address this by surpassing the capabilities of…

Computation and Language · Computer Science 2024-12-18 Zhenglin Wang , Jialong Wu , Yilong Lai , Congzhi Zhang , Deyu Zhou