mlsanityData to 7 Oct 2026

PipeInfer: Accelerating LLM Inference using Asynchronous Pipelined Speculation

arXiv 2407.11798 ↗First posted 16 Jul 2024cs.CL cs.DC cs.LGcited by 14

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

Abstract (arXiv)

Inference of Large Language Models (LLMs) across computer clusters has become a focal point of research in recent times, with many acceleration techniques taking inspiration from CPU speculative execution. These techniques reduce bottlenecks associated with memory bandwidth, but also increase end-to-end latency per inference run, requiring high speculation acceptance rates to improve performance. Combined with a variable rate of acceptance across tasks, speculative inference techniques can result in reduced performance. Additionally, pipeline-parallel designs require many user requests to maintain maximum utilization. As a remedy, we propose PipeInfer, a pipelined speculative acceleration technique to reduce inter-token latency and improve system utilization for single-request scenarios while also improving tolerance to low speculation acceptance rates and low-bandwidth interconnects. PipeInfer exhibits up to a 2.15× improvement in generation speed over standard speculative inference. PipeInfer achieves its improvement through Continuous Asynchronous Speculation and Early Inference Cancellation, the former improving latency and generation speed by running single-token inference simultaneously with several speculative runs, while the latter improves speed and latency by skipping the computation of invalidated runs, even in the middle of inference.

Key facts. Cited by 14 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 19 of its 35 references that are in the map. First posted on arXiv 16 Jul 2024.

Builds on

19 of 35 references.

Closest ancestors · 2

Same direction, newest first

  1. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
  2. 2023Accelerating LLM Inference with Staged Speculative Decoding8 Aug

Other references · 17

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  4. 2016Pointer Sentinel Mixture Modelscited by 2,992
  5. 2024Mixtral of Expertscited by 1,785
  6. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
  7. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  8. 2024Yi: Open Foundation Models by 01.AIcited by 706
  9. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 700
  10. 2023The Falcon Series of Open Language Modelscited by 526
  11. 2023QuIP: 2-Bit Quantization of Large Language Models With Guaranteescited by 397
  12. 2022Confident Adaptive Language Modelingcited by 297
5 more
  1. 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 285
  2. 2019Depth-Adaptive Transformercited by 227
  3. 2018NVIDIA Tensor Core Programmability, Performance & Precisioncited by 77
  4. 2023SPEED: Speculative Pipelined Execution for Efficient Decodingcited by 47
  5. 2023Predictive Pipelined Decoding: A Compute-Latency Trade-off for Exact LLM Decodingcited by 40

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 11; 2026: 3.

14 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2025PipeSpec: Breaking Stage Dependencies in Hierarchical LLM Decoding
  2. 2025Faster and Better LLMs via Latency-Aware Test-Time Scaling
  3. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification
  4. 2024Speculative Streaming: Fast LLM Inference without Auxiliary Models
  5. 2024Minions: Accelerating Large Language Model Inference with Aggregated Speculative Execution
  6. 2026Speculative Pipeline Decoding: Higher-Accuracy Drafting with Hidden Latency via Pipeline Parallelism
  7. 2025Efficient LLM Inference with Activation Checkpointing and Hybrid Caching
  8. 2023SARATHI: Efficient LLM Inference by Piggybacking Decodes with Chunked Prefills