arXiv (All)
open access
Block Sparse Attention with Log-Linear Complexity
Scaling language models to long contexts is limited by the quadratic cost of self-attention. Block sparse attention offers an efficient alternative, but selecting the retained blocks remains a bottleneck. Conventional block selection requires scoring all query-block pairs and therefore remains quadr
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
- Gathered, Not Admitted: How Attention Brings a Latent Variable into Verbalizable Form#612453
- From Search to Research: Exploring Search Scaling in Autonomous Quantitative Factor Mining#1130139
- From Search to Research: Exploring Search Scaling in Autonomous Quantitative Factor Mining#1108811
- It's Not RoPE that Creates Sinks: The Role of Self-Concentration and Value-Non-Mixing in Attention#986688
- Scalable, context-sensitive psychiatric assessment with large language models and brief diaries#223244
Record · ID 1105651
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