arXiv (All)
open access
LeanSparse: Memory-Efficient Serving for Native Sparse-Attention LLMs
Sparse attention limits the history read by each query, but serving long contexts still requires substantial GPU memory. Existing KV offloading systems retain the full history of indexer keys on GPU, limiting decode concurrency. Prefill's temporary memory demand can further delay admission even when
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
- LeanSparse: Memory-Efficient Serving for Native Sparse-Attention LLMs#1527894
- DASC: Decay-Aware State Compression for Hybrid Linear-Attention Serving#799590
- MemoryAthena: Adaptive Routing over Latent and Generated Memories#1061481
- Unified AI Gateway: A Framework for Joint Model Routing and KV Cache Management#668000
- Memory-Efficient Expert Routing for Distributed MoE Training#1216708
Record · ID 1610811
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