SIFT: Selective-Index For Fast Compute of RAG Prefill by Exploiting Attention Invariance 文章

ArXiv CS.AI2026-06-09NEWSen作者: Rya Sanovar, Srikant Bharadwaj, Hritvik Taneja, Moinuddin Qureshi

详细信息

来源站点
ArXiv CS.AI
作者
Rya Sanovar, Srikant Bharadwaj, Hritvik Taneja, Moinuddin Qureshi
文章类型
NEWS
语言
en
发布日期
2026-06-09

摘要

arXiv:2606.09441v1 Announce Type: new Abstract: Retrieval-Augmented Generation (RAG) injects LLM queries with relevant documents to improve response quality. This injection increases prompt length and slows time to first token (TTFT). Unlike standard queries, RAG queries have a unique property of context reuse where the same documents recur across user queries. Thus, fully recomputing documents for every RAG query does redundant compute and increases TTFT. Prior works precompute KV tensors of RAG documents offline and coarsely recompute some tokens during online prefill. However, such KV reuse is often slower than full recomputation on modern GPUs due to high-latency disk transfers. Further, such a coarse-grained recomputation degrades accuracy. To address these limitations, this paper proposes SIFT: Selective-Index For Fast Compute of RAG Prefill by Exploiting Attention Invariance.

相关事件

暂无数据

相关公司

暂无数据

相关人物

暂无数据

相关产品

暂无数据