arxiv
PublishedOctober 3, 2026 at 4:00 AM
—neutral
CommunityKV: Efficient Long-Context Decoding via Graph Partitioning
Publisher summary· verbatim
arXiv:2610.00418v1 Announce Type: new Abstract: 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 req
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSequential Capacity of Quantum Processes with Finite Memory8harxivQ-MINO: A Minimal-Norm Method for Quantization-Aware Training8harxivExploiting Exogenous Structure for Sample-Efficient Reinforcement Learning8harxivRethinking the Global Convergence of Softmax Policy Gradient with Linear Function Approximation: The Case of Multi-Armed Bandits8hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗