论文

MoSAR:用语义注意力混合学习自适应注意力几何

MoSAR: Mixture of Semantic Attention Regimes for Learning Adaptive and Approximable Attention Geometries

精选理由

一篇注意力机制新论文,MoSAR 让模型自己学注意力的距离衰减方式,500M 参数实验里困惑度赢过 RoPE 和 ALiBi,长文本方向的可以看看。

arXiv 论文 MoSAR 提出把注意力近似当作几何问题来处理,而非预先固定稀疏模式。该方法在位置编码后用输入条件化的 query/key 路由器,在短程、中程和全局三种注意力范围之间学习混合权重。在匹配的 500M 参数预训练实验中,MoSAR 在训练上下文长度上的困惑度超过稠密 RoPE,长度外推时困惑度优于 ALiBi 等基线。学习到的几何在 top-1 路由离散化后依然稳定,可在推理时低成本近似。

原文 · arXiv cs.AI

MoSAR: Mixture of Semantic Attention Regimes for Learning Adaptive and Approximable Attention Geometries

The quadratic complexity of dense self-attention remains a central bottleneck for long-context language modeling. Many efficient alternatives address this cost by deciding in advance where attention should be sparse or local. We argue that attention approximation should instead be approached as a geometric problem, with the relevant interaction geometry learned from data: natural-language dependencies are input-dependent and difficult to prescribe in advance, so the model should learn where positional relevance can decay and where broader interactions must be preserved. We introduce Mixture of Semantic Attention Regimes (MoSAR), which learns such an adaptive, controlled-decay geometry over query--key interactions. Input-conditioned query and key routers, applied after positional encoding, select mixtures over short, medium, and global regimes, inducing a continuous distance-dependent attention field rather than a fixed sparsity pattern. This geometry is learned during training and can subsequently be discretized through top-1 routing. In controlled pre-training experiments with matched 500M-parameter models, MoSAR learns a substantially lower-reach attention geometry without degrading language-modeling quality, improving perplexity over dense RoPE at the training context length. Under length extrapolation, MoSAR achieves the best perplexity among all evaluated variants, including strong baselines such as ALiBi. Moreover, the learned geometry remains stable under deterministic top-1 discretization, suggesting that it is not only adaptive, but also amenable to low-cost approximation at inference time.