arXiv (All)
open access
Attention under Bounded Key-Query Similarity: Space Complexity and Transformer Anisotropy
A growing body of work on KV-cache compression aims to reduce the memory requirements of autoregressive generation. These methods compress the stored context while approximately preserving attention computation, enabling generation with reduced memory consumption. Almost tight theoretical results on
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
- Fine-Tuning a KV Cache Concatenation-Aware Model or Recomputing KV Caches? Why Not Both?#996590
- The KV-Surgeon: Compensation-Aware Offline KV-Cache Compaction#1401122
- A trace of memory#63889
- A Trace of Memory#54985
- Memory That Looks Forward: A Zero-Inference Prospective Term for Personal Memory Retrieval#1036775
Record · ID 1458490
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