arXiv (All)
open access
The KV-Surgeon: Compensation-Aware Offline KV-Cache Compaction
Offline compaction of the key--value cache (KV-cache) reduces the cost of repeatedly querying a fixed context by constructing a smaller cache once and reusing it subsequently. The central challenge of compaction is deciding which cache entries to delete and which to retain. Existing methods score ea
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Probabilistic Interpretation of KV Cache Eviction#618625
- Faithfulness Is Not Free: Auditing Offline KV-Cache Quantization in Retrieval-Augmented Generation#819033
- Faithfulness Is Not Free: Auditing Offline KV-Cache Quantization in Retrieval-Augmented Generation#809041
- ANCHOR: A Vision for Secure Persistent Key-Value Stores in Disaggregated Data Centers#781108
- ANCHOR: A Vision for Secure Persistent Key-Value Stores in Disaggregated Data Centers#779733
Record · ID 1401122
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive