REVIEW 6 cited by
GPT Semantic Cache: Reducing LLM Costs and Latency via Semantic Embedding Caching
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
read the original abstract
Large Language Models (LLMs), such as GPT, have revolutionized artificial intelligence by enabling nuanced understanding and generation of human-like text across a wide range of applications. However, the high computational and financial costs associated with frequent API calls to these models present a substantial bottleneck, especially for applications like customer service chatbots that handle repetitive queries. In this paper, we introduce GPT Semantic Cache, a method that leverages semantic caching of query embeddings in in-memory storage (Redis). By storing embeddings of user queries, our approach efficiently identifies semantically similar questions, allowing for the retrieval of pre-generated responses without redundant API calls to the LLM. This technique achieves a notable reduction in operational costs while significantly enhancing response times, making it a robust solution for optimizing LLM-powered applications. Our experiments demonstrate that GPT Semantic Cache reduces API calls by up to 68.8% across various query categories, with cache hit rates ranging from 61.6% to 68.8%. Additionally, the system achieves high accuracy, with positive hit rates exceeding 97%, confirming the reliability of cached responses. This technique not only reduces operational costs, but also improves response times, enhancing the efficiency of LLM-powered applications.
Forward citations
Cited by 6 Pith papers
-
From Tensor Buffer to Distributed Memory Hierarchy: A Survey of KV Cache Management for LLM Serving
KV-cache serving systems concentrate into five archetypes under a four-axis taxonomy, with ownership explaining residual distributed design variance and seven measurement gaps blocking next steps.
-
From Similarity to Vulnerability: Key Collision Attack on LLM Semantic Caching
An attacker can force false cache-key collisions in LLM semantic caching and hijack responses or agent tool calls, with 86% hit rate in experiments.
-
Rethinking Query Optimization for Multi-Agent Systems [Vision]
Agentic data pipelines are built by hand today; this paper sets a research agenda for automatically optimizing their structure, model choices, and execution engines jointly as a new query-optimization problem.
-
TweakLLM: A Routing Architecture for Dynamic Tailoring of Cached Responses
A small language model can rewrite cached large-model responses to fit similar new queries, preserving quality while cutting inference cost.
-
MultiFluxAI Enhancing Platform Engineering with Advanced Agent-Orchestrated Retrieval Systems
The authors claim their MultiFluxAI orchestration framework achieves 95% accuracy and 0-10 ms responses by combining rule-based routing, caching, and graph knowledge stores for multi-service RAG queries.
-
ODIA: Oriented Distillation for Inline Acceleration of LLM-based Function Calling
ODIA routes 60% of function-calling traffic in a music app to a small 1.3B model, reducing expected latency by 45% and median latency by 78%.
Discussion (0). Continue with ORCID to comment.