arXiv (All)
open access
CommunityKV: Efficient Long-Context Decoding via Graph Partitioning
Scaling Transformers to long contexts is constrained by the quadratic cost of self-attention and the linear growth of key-value cache memory transfer. Sparse attention mitigates this by retrieving only relevant tokens, but current approaches either require large-scale training or, within the trainin
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
- SparseBalance: Load-Balanced Long Context Training with Dynamic Sparse Attention#14041
- Don't Read Everything: A Curvature-Conditioned Query for Linear Attention#793703
- Don't Read Everything: A Curvature-Conditioned Query for Linear Attention#789699
- AgentIR: A Workload-Adaptive Cascade Retrieval Substrate for Long-Term Conversational Memory#229612
- Self-Indexing Attention for Compression-Compatible Sparse Long-Context LLM Inference#1071012
Record · ID 1155353
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