arXiv 2610.13990 · cs.LG · 2026-09-26
DoSA: Dots Sparse Attention
Fanxu Meng, Taosong Fang
dots studio
在最新榜 #184 本站收录于 2026-10-21
一句话要点
DoSA 用上下界证明提前排除不可能入选的 key，在不改变 Top-K 结果的前提下加速稀疏注意力。
DoSA uses bounds to reject keys early, speeding up sparse attention without changing exact Top-K selection.
阅读 arXiv 原文 PDF Hugging Face 讨论 代码仓库
主题与学科
同主题：高效训练与推理
- 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
数据说明
元数据来自 arXiv API（已核实）；点赞来自 Hugging Face 每日论文；引用来自 Semantic Scholar。最近刷新 2026-10-22。
要点由本站根据摘要自写，不转载摘要原文，请阅读原文。