arXiv (All)
open access
KV-Kaizen: Learning Context-Adaptive Cache Compression Choices
As the context size of text processed with an LLM grows, the size of KV caches can outstrip the memory allocated for the original model weights. This impacts LLM throughput negatively, since decoding is memory-bound and decode cost grows with cache size. Recent work alleviates this bottleneck by dis
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
- KV-Kaizen: Learning Context-Adaptive Cache Compression Choices#1122339
- Resource-Efficient Speculative Decoding for Long-Context LLM Serving#1117896
- Residual Vector-based Reconstruction as Long-Context Recall Regardless of Context Window Size#1070167
- Tutti: Making SSD-Backed KV Cache Practical for Long-Context LLM Serving#155400
- Building py-kvcache: A Performance Characterization of External KV Caching for vLLM with NVMe SSDs#999433
Record · ID 1144877
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