Leveraging Speculative Sampling and KV-Cache Optimizations Together for Generative AI using OpenVINO
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Inference optimizations are critical for improving user experience and reducing infrastructure costs and power consumption. In this article, we illustrate a form of dynamic execution known as speculative sampling to reduce the overall latency of text generation and compare it with standard autoregressive sampling. This can be used together with model-based optimizations (e.g. quantization) to provide an optimized solution. Both sampling methods make use of KV caching. A Jupyter notebook and some sample executions are provided.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 5 of its 11 references that are in the map. First posted on arXiv 8 Nov 2023.
Builds on
5 of 11 references.
Closest ancestors · 1
Same direction, newest first
Other references · 4
- 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 623
- 2022Efficiently Scaling Transformer Inferencecited by 539
- 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 323
- 2022Confident Adaptive Language Modelingcited by 310
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024Accelerated AI Inference via Dynamic Execution Methodscited by 0
- 2024Accelerated AI Inference via Dynamic Execution Methods30 Oct 2024
Similar, not cited
Close in wording, no citation either way
- 2023S3: Increasing GPU Utilization during Generative Inference for Higher Throughput
- 2025READER: Retrieval-Assisted Drafter for Efficient LLM Inference
- 2026TAPS: Task Aware Proposal Distributions for Speculative Sampling
- 2026Speculative Sampling with Reinforcement Learning
- 2025Accelerated Diffusion Models via Speculative Sampling
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models
- 2024BASS: Batched Attention-optimized Speculative Sampling
- 2024The N-Grammys: Accelerating Autoregressive Inference with Learning-Free Batched Speculation