Pith. sign in

REVIEW 3 cited by

TurboRAG: Accelerating Retrieval-Augmented Generation with Precomputed KV Caches for Chunked Text

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.07590 v1 pith:LFL6VP4F submitted 2024-10-10 cs.CV cs.CL

classification cs.CVcs.CL
keywords systemsturboragcachescomputationinferencettftcurrentgeneration
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Current Retrieval-Augmented Generation (RAG) systems concatenate and process numerous retrieved document chunks for prefill which requires a large volume of computation, therefore leading to significant latency in time-to-first-token (TTFT). To reduce the computation overhead as well as TTFT, we introduce TurboRAG, a novel RAG system that redesigns the inference paradigm of the current RAG system by first pre-computing and storing the key-value (KV) caches of documents offline, and then directly retrieving the saved KV cache for prefill. Hence, online computation of KV caches is eliminated during inference. In addition, we provide a number of insights into the mask matrix and positional embedding mechanisms, plus fine-tune a pretrained language model to maintain model accuracy of TurboRAG. Our approach is applicable to most existing large language models and their applications without any requirement in modification of models and inference systems. Experimental results across a suite of RAG benchmarks demonstrate that TurboRAG reduces TTFT by up to 9.4x compared to the conventional RAG systems (on an average of 8.6x), but reserving comparable performance to the standard RAG systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Functional Cache Grafting: Robust and Rapid Code-Policy Synthesis for Embodied Agents

    cs.PL 2026-06 unverdicted novelty 6.0 of 10

    FCGraft synthesizes code policies for embodied agents by grafting KV caches from a library of validated functions, claiming 18.31% higher success rate and 2.3x faster synthesis than prompt-level caching.

  2. Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation

    cs.CL 2025-05 conditional novelty 6.0 of 10

    By storing KV caches of prior reasoning traces and retrieving them during generation, LAG improves LLM agent accuracy and efficiency over standard agentic systems and reflection methods.

  3. Mixture-of-Translators: Translating KV Caches Across Heterogeneous Large Language Models

    cs.CL 2026-07 conditional novelty 4.0 of 10

    MoT translates KV caches between LLMs using token-level translator mixtures and a context-correction loss; QA results are strong for same-family pairs but do not demonstrate true cross-architecture reuse.

Pith tools