arXiv 2610.13990 · cs.LG · 2026-09-26
DoSA: Dots Sparse Attention
Fanxu Meng, Taosong Fang
dots studio
In latest · #184 Added on 2026-10-21
One-line takeaway
DoSA uses bounds to reject keys early, speeding up sparse attention without changing exact Top-K selection.
DoSA 用上下界证明提前排除不可能入选的 key，在不改变 Top-K 结果的前提下加速稀疏注意力。
Read on arXiv PDF Hugging Face discussion Code
Topics & disciplines
More on Efficient training & inference
- The Teacher Is a Direction, Not a Destination: Extrapolating RL-Induced Representation Residuals in On-Policy Distillation ▲511
- Scaling Properties of Same-Family On-Policy Distillation ▲327
- Beyond Domain-Routed Supervision: Cross-Teacher Guarding for Multi-Teacher On-Policy Distillation ▲251
- On-Policy or Off-Policy Learning? A Systematic Study of Distillation Dynamics ▲205
- Beyond Teacher Assignment: Domain-Normalized Multi-Teacher On-Policy Distillation ▲181
About this data
Metadata from the arXiv API (verified); upvotes from Hugging Face Daily Papers; citations from Semantic Scholar. Last refreshed 2026-10-22.
The takeaway is written by AIMap from the abstract; the abstract itself is not reproduced — read the original.