arXiv (All)
open access
Every Cache Entry Earns Its Place: Global Allocation of Resolution and Coverage for KV Cache Compression
As large language models (LLMs) process increasingly long contexts, KV cache storage and repeated access have become a major bottleneck. Existing KV cache compression methods rely on predefined, fixed compression rules and are typically developed around either token eviction or merging. As a result,
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
- KVServe: Service-Aware KV Cache Compression for Communication-Efficient Disaggregated LLM Serving#180611
- Do Geometry-Aware Positional Encodings Help Transformers in Spatial Imperfect-Information Games?#612418
- Where Do LLMs Decide to Break the Rules? Mechanistic Localization of Prompt Injection Compliance#1142049
- Where Do LLMs Decide to Break the Rules? Mechanistic Localization of Prompt Injection Compliance#1122191
- AppFlow: Memory Scheduling for Cold Launch of Large Apps on Mobile and Vehicle Systems#2720
Record · ID 1325231
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