arxiv
PublishedOctober 15, 2026 at 4:00 AM
Joint Subspace Sparse Attention for Efficient Long-Context Decoding
Publisher summary· verbatim
arXiv:2610.19026v1 Announce Type: new Abstract: Sparse attention reduces the KV-cache traffic that dominates long-context LLM decoding, but practical methods largely operate at coarse granularity. Token-level selection offers finer control, yet presents two challenges: low-dimensional scoring may lo
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivOptimal Hydra: Model Heterogeneous Federated Learning for LLMs using Data-Informed Hydra-Nets2darxivJudging the Judges: Confidence and Disagreement in Rubrics as Rewards2darxivContent associations with answer selection and engagement in supply chain community question answering2dThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗