arXiv (All)
open access
ResidualKV: Residual-Based KV Cache Compression for Efficient Long-Context Inference
Efficient long-context inference faces two coupled bottlenecks: KV-cache memory grows linearly with context length, while attention computation grows quadratically. Existing approaches typically address one at the expense of irreversible token eviction, full-cache retention, or full-history reconstr
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
- KernelFlume: Elastic Core-Attention Scaling for Agentic Long-Context Decoding#321808
- Runtime Observability for Heterogeneous Attention Memory#615148
- Runtime Observability for Heterogeneous Attention Memory#614181
- Draft-KV: Learning Useful Latent Communication Between Language Models#1129012
- SubjectAnchor: Subject-Aware Memory-to-Video for Multi-Shot Storytelling#1128770
Record · ID 1143682
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