atlas

Research map / Large language models / Reasoning and chain of thought

vCache: Verified Semantic Prompt Caching

ICLR 2026 · Large language models › Reasoning and chain of thought · approach: KV cache compression · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes vCache, a semantic prompt cache that learns a per-embedding similarity threshold online via sigmoid logistic fitting, giving user-defined error-rate guarantees while maximizing cache hits.

Problem

Semantic caches for LLMs use a single static similarity threshold, which gives no formal error-rate guarantees, yields unexpected error rates, and suboptimal cache hit rates.

Approach

Learn an embedding-specific decision threshold online by fitting a sigmoid model of correctness versus similarity to observed cache outcomes, using confidence bounds and randomized exploration to enforce a user-specified error bound delta without offline training.

Key results

Surprising findings

Limitations

Experimental setup

Datasets: LM-Arena human preference dataset three classification datasets web-search queries

Benchmarks: SemCacheLMArena SemCacheClassification SemCacheSearchQueries SemCacheCombo

Metrics: error rate cache hit rate latency ROC curve

Baselines: GPTCache GPTCache + fine-tuned embedding vCache + fine-tuned embedding

Builds on: GPTCache HNSW Extreme Value Machine

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy