arXiv (All)
open access
Sparse Attention Is Matrix Approximation, Not Choosing from a Bag of Values
Large Language Models (LLMs) achieve strong performance across many domains, but their efficiency is limited by the quadratic cost of attention with respect to prompt length. Sparse attention reduces this cost by retaining only a small fraction of query-key interactions to approximate the full atten
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
- ARM: Attention with Routed-Memory for Learnable Sparse Control#1050595
- Demystifying LLM-as-a-Judge: Analytically Tractable Model for Inference-Time Scaling#1187287
- Moloch's Bargain: Emergent Misalignment When LLMs Compete for Audiences#1156216
- On Epistemic Diversity in Large Language Models#971500
- Towards In-Parameter Memory Augmentation for Large Language Models#1218422
Record · ID 1247798
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