arXiv (All)
open access
PAGE: Partition-Aware Gated KV-Cache Eviction
KV-cache eviction methods decide which tokens to keep but not whether to evict at all, so a benchmark mean can hide a class of inputs on which compression drives accuracy from 99\% to 0\%. We reframe eviction as a per-input admission decision and show that inputs separate into a capacity-bound class
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
- Error Certificates for KV-Cache Eviction via Randomized Design#394402
- RelaxKV: Recomputation Guided by the Query with Sparse Context Attention for Efficient KV Cache Reuse#1118215
- Real-Time and Portable Chaos-based Crypto-Compression Systems for Efficient Embedded Architectures#398766
- Improving Progressive Compression with Adaptive Interpolation and Coefficient Decomposition#927849
- Opportunistic ZGC: Leveraging Idle Cores for More Effective Concurrent Garbage Collection#919343
Record · ID 1036840
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