mlsanityData to 7 Oct 2026

Minions: Accelerating Large Language Model Inference with Aggregated Speculative Execution

arXiv 2402.15678 ↗First posted 24 Feb 2024cs.DCcited by 3

On the map: Efficient LLM inference and serving → Speculative decoding

Abstract (arXiv)

Large language models (LLM) have recently attracted surging interest due to their outstanding capabilities across various domains. However, enabling efficient LLM inference is challenging due to its autoregressive decoding that generates tokens only one at a time. Although research works apply pruning or quantization to speed up LLM inference, they typically require fine-tuning the LLM, incurring significant time and economic costs. Meanwhile, speculative decoding has been proposed to use small speculative models (SSMs) to accelerate the inference of LLM. However, the low acceptance rate of SSM and the high verification cost of LLM prohibit further performance improvement of inference. In this paper, we propose Minions, an LLM inference system that accelerates LLM inference with a collective and adaptive speculative generation. Specifically, Minions proposes a majority-voted mechanism to leverage multiple SSMs to jointly speculate the outputs of LLM, which improves the inference performance without introducing prohibitive computation costs for LLM. To better trade off the number of tokens speculated from SSM and the verification cost of LLM, Minions proposes an adaptive mechanism to dynamically determine the optimal speculation length of SSM, which can achieve better inference performance across different models, datasets, and hyper-parameters. In addition, Minions decouples the SSM decoding and LLM verification efficiently and adopts a pipelined execution mechanism to further improve the inference performance of LLM. By comparing with the state-of-the-art LLM inference systems, we demonstrate that Minions can achieve higher inference throughput and lower inference time.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 24 of its 51 references that are in the map. First posted on arXiv 24 Feb 2024.

Builds on

24 of 51 references.

Closest ancestors · 3

Same direction, newest first

  1. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
  2. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  3. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 21

  1. 2017Attention Is All You Needcited by 59,932
  2. 2023GPT-4 Technical Reportcited by 18,132
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  4. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  5. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  6. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  7. 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,281
  8. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
  9. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  10. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 809
  11. 2023Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizescited by 710
  12. 2020Recipes for building an open-domain chatbotcited by 593
9 more
  1. 2023FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPUcited by 567
  2. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
  3. 2020Towards a Human-like Open-Domain Chatbotcited by 467
  4. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
  5. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  6. 2017A Deep Reinforced Model for Abstractive Summarizationcited by 364
  7. 2022Language Models in the Loop: Incorporating Prompting into Weak Supervisioncited by 51
  8. 2020LightSeq: A High Performance Inference Library for Transformerscited by 4
  9. 2016Review Networks for Caption Generationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025SPIN: Accelerating Large Language Model Inference with Heterogeneous Speculative Models
  2. 2026Faster LLM Inference via Sequential Monte Carlo
  3. 2025Accelerating LLM Inference with Lossless Speculative Decoding Algorithms for Heterogeneous Vocabularies
  4. 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding
  5. 2024Beyond the Speculative Game: A Survey of Speculative Execution in Large Language Models
  6. 2024Generation Meets Verification: Accelerating Large Language Model Inference with Smart Parallel Auto-Correct Decoding
  7. 2025AdaSD: Adaptive Speculative Decoding for Efficient Language Model Inference
  8. 2023Draft & Verify: Lossless Large Language Model Acceleration via Self-Speculative Decoding