Caching Historical Embeddings in Conversational Search
Not on the map. Why?
Abstract (arXiv)
Rapid response, namely low latency, is fundamental in search applications; it is particularly so in interactive search sessions, such as those encountered in conversational settings. An observation with a potential to reduce latency asserts that conversational queries exhibit a temporal locality in the lists of documents retrieved. Motivated by this observation, we propose and evaluate a client-side document embedding cache, improving the responsiveness of conversational search systems. By leveraging state-of-the-art dense retrieval models to abstract document and query semantics, we cache the embeddings of documents retrieved for a topic introduced in the conversation, as they are likely relevant to successive queries. Our document embedding cache implements an efficient metric index, answering nearest-neighbor similarity queries by estimating the approximate result sets returned. We demonstrate the efficiency achieved using our cache via reproducible experiments based on TREC CAsT datasets, achieving a hit rate of up to 75% without degrading answer quality. Our achieved high cache hit rates significantly improve the responsiveness of conversational systems while likewise reducing the number of queries managed on the search back-end.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Nov 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 2; 2026: 4.
6 papers.
- 2025When Memory Becomes a Vulnerability: Towards Multi-turn Jailbreak Attacks against Text-to-Image Generation Systemscited by 5
- 2026QVCache: A Query-Aware Vector Cachecited by 2
- 2026PELM: Power Efficient On-Device LLM Inference with Speculative Decoding and Dynamic Voltage Frequency Scalingcited by 2
- 2025Leveraging Approximate Caching for Faster Retrieval-Augmented Generationcited by 1
- 2026HaS: Accelerating RAG through Homology-Aware Speculative Retrievalcited by 0
- 2026Embedding Surgery: Localized Updates for Adaptive Ranking Correction in Dense Retrievalcited by 0
- 2026PELM: Power Efficient On-Device LLM Inference with Speculative Decoding and Dynamic Voltage Frequency Scaling9 Sep 2026
- 2026Embedding Surgery: Localized Updates for Adaptive Ranking Correction in Dense Retrieval4 Sep 2026
- 2026HaS: Accelerating RAG through Homology-Aware Speculative Retrieval22 Apr 2026
- 2026QVCache: A Query-Aware Vector Cache2 Feb 2026
- 2025When Memory Becomes a Vulnerability: Towards Multi-turn Jailbreak Attacks against Text-to-Image Generation Systems29 Apr 2025
- 2025Leveraging Approximate Caching for Faster Retrieval-Augmented Generation7 Mar 2025