mlsanityData to 7 Oct 2026

CREST: Effectively Compacting a Datastore For Retrieval-Based Speculative Decoding

arXiv 2408.04678 ↗First posted 8 Aug 2024cs.CL cs.AI cs.DBcited by 1

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

Abstract (arXiv)

We present CREST (Compact Retrieval-Based Speculative Decoding), a redesign of REST that allows it to be effectively "compacted". REST is a drafting technique for speculative decoding based on retrieving exact n-gram matches of the most recent n tokens generated by the target LLM from a datastore. The key idea of CREST is to only store a subset of the smallest and most common n-grams in the datastore with the hope of achieving comparable performance with less storage space. We found that storing a subset of n-grams both reduces storage space and improves performance. CREST matches REST's accepted token length with 10.6-13.5x less storage space and achieves a 16.5-17.1% higher acceptance length than REST using the same storage space on the HumanEval and MT Bench benchmarks.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 12 of its 15 references that are in the map. First posted on arXiv 8 Aug 2024.

Builds on

12 of 15 references.

Closest ancestors · 8

Same direction, newest first

  1. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  2. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
  3. 2023PaSS: Parallel Speculative Sampling22 Nov
  4. 2023REST: Retrieval-Based Speculative Decoding14 Nov
  5. 2023Accelerating LLM Inference with Staged Speculative Decoding8 Aug
  6. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  7. 2022Fast Inference from Transformers via Speculative Decoding30 Nov
  8. 2022Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generation30 Mar

Other references · 4

  1. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  2. 2023Code Llama: Open Foundation Models for Codecited by 2,105
  3. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318
  4. 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: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025DReSD: Dense Retrieval for Speculative Decoding
  2. 2025LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation
  3. 2024SSSD: Simply-Scalable Speculative Decoding
  4. 2025Speculative Verification: Exploiting Information Gain to Refine Speculative Decoding
  5. 2025Speculative Decoding: Performance or Illusion?
  6. 2026SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding
  7. 2025CARD: A Cache-Assisted Parallel Speculative Decoding Framework via Query-and-Correct Paradigm for Accelerating LLM Inference
  8. 2026A Practical Investigation of Training-free Relaxed Speculative Decoding