Chimera: A Lossless Decoding Method for Accelerating Large Language Models Inference by Fusing all Tokens
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Large language models (LLMs) have demonstrated remarkable capabilities across various tasks. However, their widespread application is hindered by the resource-intensive decoding process. To address this challenge, current approaches have incorporated additional decoding heads to enable parallel prediction of multiple subsequent tokens, thereby achieving inference acceleration. Nevertheless, the accuracy of these decoding heads falls short of the auto-regressive decoding approach. In light of these limitations, we propose Chimera, a novel framework specifically designed for speculative sampling. Within this framework, we introduce a lightweight draft model that effectively utilizes previously generated tokens to predict subsequent words. To ensure both accuracy and efficiency, we present two strategies within the lightweight draft model. Firstly, we focus on capturing short-range dependencies at the bottom layer. Secondly, we leverage the readily available representations from the original LLM.Through empirical evaluation on the Vicuna and LlaMA-2 series, Chimera demonstrates impressive results, achieving an average latency speedup ratio of 2.7x compared to the vanilla auto-regressive decoding approach. This highlights the potential of our proposed framework in significantly improving the efficiency of large language models during the decoding process.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 26 of its 30 references that are in the map. First posted on arXiv 24 Feb 2024.
Builds on
26 of 30 references.
Closest ancestors · 15
Same direction, newest first
- 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
- 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
- 2023Cascade Speculative Drafting for Even Faster LLM Inference18 Dec
- 2023PaSS: Parallel Speculative Sampling22 Nov
- 2023SpecTr: Fast Speculative Decoding via Optimal Transport23 Oct
- 2023DistillSpec: Improving Speculative Decoding via Knowledge Distillation12 Oct
- 2023Online Speculative Decoding11 Oct
- 2023Accelerating LLM Inference with Staged Speculative Decoding8 Aug
- 2023Accelerating Transformer Inference for Translation via Parallel Decoding17 May
- 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
- 2023Speculative Decoding with Big Little Decoder15 Feb
3 more
Other references · 11
- 2023GPT-4 Technical Reportcited by 18,396
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2023Qwen Technical Reportcited by 3,344
- 2023PaLM 2 Technical Reportcited by 1,162
- 2020A Primer in BERTology: What we know about how BERT workscited by 815
- 2023Baichuan 2: Open Large-scale Language Modelscited by 670
- 2023The Falcon Series of Open Language Modelscited by 535
- 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 323
- 2022On The Computational Complexity of Self-Attentioncited by 139
- 2023SPEED: Speculative Pipelined Execution for Efficient Decodingcited by 47
- 2023Predictive Pipelined Decoding: A Compute-Latency Trade-off for Exact LLM Decodingcited by 40
Built on by
Citing papers per year: 2024: 3; 2025: 2; 2026: 1.
6 papers.
- 2025GRIFFIN: Effective Token Alignment for Faster Speculative Decodingcited by 16
- 2026TALON: Confidence-Aware Speculative Decoding with Adaptive Token Treescited by 13
- 2024Clover: Regressive Lightweight Speculative Decoding with Sequential Knowledgecited by 10
- 2025Bridging Draft Policy Misalignment: Group Tree Optimization for Speculative Decodingcited by 10
- 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decodingcited by 7
- 2024Clover-2: Accurate Inference for Regressive Lightweight Speculative Decodingcited by 5
- 2026TALON: Confidence-Aware Speculative Decoding with Adaptive Token Trees12 Jan 2026
- 2025Bridging Draft Policy Misalignment: Group Tree Optimization for Speculative Decoding26 Sep 2025
- 2025GRIFFIN: Effective Token Alignment for Faster Speculative Decoding16 Feb 2025
- 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding20 Nov 2024
- 2024Clover-2: Accurate Inference for Regressive Lightweight Speculative Decoding1 Aug 2024
- 2024Clover: Regressive Lightweight Speculative Decoding with Sequential Knowledge1 May 2024
Similar, not cited
Close in wording, no citation either way
- 2023Draft & Verify: Lossless Large Language Model Acceleration via Self-Speculative Decoding
- 2024Towards Fast Multilingual LLM Inference: Speculative Decoding and Specialized Drafters
- 2024Generation Meets Verification: Accelerating Large Language Model Inference with Smart Parallel Auto-Correct Decoding
- 2025READER: Retrieval-Assisted Drafter for Efficient LLM Inference
- 2025AdaSD: Adaptive Speculative Decoding for Efficient Language Model Inference
- 2026Speculative Decoding and the Curse of Multilinguality
- 2024A Survey on Efficient Inference for Large Language Models
- 2024Turning Trash into Treasure: Accelerating Inference of Large Language Models with Token Recycling