mlsanityData to 14 Oct 2026

Closing the Operational Gap in Semantic Caching

arXiv 2606.19719 ↗First posted 18 Jun 2026cs.IR cs.CL cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Semantic caching cuts LLM inference costs by serving a cached response to semantically similar queries. Standard practice evaluates these systems using PR-AUC, a metric that only measures how well scores rank and ignores whether they are usable at a fixed threshold. We show this mismatch leads to systematically poor deployment choices, as models with the highest PR-AUC are often the worst in operation. We introduce Precision--Cache Hit Ratio (P-CHR) AUC, a cache-aware metric that measures precision across cache utilization levels, and Operational Retention Rate (ORR), which captures how much offline ranking quality survives at deployment. We decompose the operational gap between offline and deployed quality into a recoverable threshold-utility component and an irreducible structural component fixed by the dataset's positive rate. Our experiments show that the threshold-utility gap is governed by the training objective rather than data scale, and yields only to re-normalizing scores over the candidate pool or changing the training objective. Ultimately, model selection for semantic caching is a threshold-utility problem, not a ranking one, and measuring it is the first step to closing the gap.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 30 of its 49 references that are in the map. First posted on arXiv 18 Jun 2026.

Builds on

30 of 49 references.

References · 30

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  2. 2017On Calibration of Modern Neural Networkscited by 4,960
  3. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  4. 2017Billion-scale similarity search with GPUscited by 2,497
  5. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  6. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,463
  7. 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,253
  8. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  9. 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 1,001
  10. 2022Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Taskscited by 868
  11. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
  12. 2023Towards General Text Embeddings with Multi-stage Contrastive Learningcited by 723
18 more
  1. 2019Passage Re-ranking with BERTcited by 645
  2. 2023C-Pack: Packed Resources For General Chinese Embeddingscited by 578
  3. 2024Smarter, Better, Faster, Longer: A Modern Bidirectional Encoder for Fast, Memory Efficient, and Long Context Finetuning and Inferencecited by 554
  4. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 476
  5. 2019PAWS: Paraphrase Adversaries from Word Scramblingcited by 402
  6. 2024Nomic Embed: Training a Reproducible Long Context Text Embeddercited by 265
  7. 2024mGTE: Generalized Long-Context Text Representation and Reranking Models for Multilingual Text Retrievalcited by 236
  8. 2023Jina Embeddings 2: 8192-Token General-Purpose Text Embeddings for Long Documentscited by 104
  9. 2024Arctic-Embed 2.0: Multilingual Retrieval Without Compromisecited by 58
  10. 2018Open Subtitles Paraphrase Corpus for Six Languagescited by 24
  11. 2024GPT Semantic Cache: Reducing LLM Costs and Latency via Semantic Embedding Cachingcited by 22
  12. 2021Improving Paraphrase Detection with the Adversarial Paraphrasing Taskcited by 19
  13. 2024MeanCache: User-Centric Semantic Caching for LLM Web Servicescited by 14
  14. 2025Semantic Caching for Low-Cost LLM Serving: From Offline Learning to Online Adaptationcited by 13
  15. 2020PARADE: A New Dataset for Paraphrase Identification Requiring Computer Science Domain Knowledgecited by 7
  16. 2024Schroedinger's Threshold: When the AUC doesn't predict Accuracycited by 4
  17. 2026ColBERT-Zero: To Pre-train Or Not To Pre-train ColBERT modelscited by 4
  18. 2026From Exact Hits to Close Enough: Semantic Caching for LLM Embeddingscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.