arXiv CS
open access
Stratified Sparse Attention: Reducing the Sparse-to-Dense Gap at Extreme Sparsity
Large Language Model inference over long contexts is increasingly bottlenecked by the cost of attending to a growing Key-Value (KV) cache. Sparse attention reduces this cost by accessing only a fraction of the cache, but existing methods face a trade-off between deterministic retrieval, which captur
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
- OVAL: Output-Aware Local Page Bases for KV Cache Retrieval#1215777
- OVAL: Output-Aware Local Page Bases for KV Cache Retrieval#1194443
- RoLaQ: Joint Rotation and Range Calibration for 2-Bit KV Caches in Multi-Head Latent Attention#1355675
- BELT : BEhavior-Aligned Low-Rank KV Cache Compression with Learned Top-k Rank Allocation#1343165
- Scaling Parameter and Context in Attention: Native Sparse Attention from Mixture-of-Head#1143433
Record · ID 1394291
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