arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.09883cs.CLcs.LG
收藏

DELTA: 动态层感知令牌注意力机制用于高效的长上下文推理

DELTA: Dynamic Layer-Aware Token Attention for Efficient Long-Context Reasoning

University of Southern California(南加州大学)

Hossein Entezari Zarch, Lei Gao, Chaoyi Jiang, Murali Annavaram

AI总结:

DELTA通过动态层感知令牌注意力机制提升长上下文推理效率,减少计算成本而不牺牲准确性,在AIME和GPQA-Diamond等基准上表现优异。

摘要:

大型推理模型(LRMs)通过生成长链中间步骤在挑战性基准上取得最佳性能,但其推理成本主要由解码过程主导,每个新令牌必须关注整个增长序列。为减少延迟,一种方法是从键值(KV)缓存中移除条目,从而减少注意力计算中的活跃上下文。然而,此类稀疏注意力方法在推理任务中因累积选择误差和长期推导中令牌重要性的演变而导致严重准确性下降。我们提出了DELTA,一种训练自由的稀疏注意力机制,通过将Transformer层分为三组:使用完整注意力的初始层、一小部分Δ层,通过聚合头部级注意力分数识别显著令牌,以及后续仅关注选定子集的稀疏注意力层。该设计在GPU内存中保留完整的KV缓存以保证准确性,同时避免了对多层进行昂贵的完整注意力计算。在推理基准如AIME和GPQA-Diamond上,DELTA在准确性上匹配或超越完整注意力,同时将所关注的令牌数量减少多达4.25倍,并提供1.54倍的端到端加速。我们的结果表明,选择性重用中间注意力图为高效长上下文推理提供了稳健的路径。代码可在https://github.com/hoenza/DELTA获取。

英文摘要:

Large reasoning models (LRMs) achieve state-of-the-art performance on challenging benchmarks by generating long chains of intermediate steps, but their inference cost is dominated by decoding, where each new token must attend to the entire growing sequence. One approach to reduce this latency is to evict entries from the key-value (KV) cache, thereby reducing the active context used in attention computation. However, such sparse attention methods suffer from severe accuracy degradation on reasoning tasks due to cumulative selection errors and the evolving importance of tokens over long derivations. We present \textbf{DELTA}, a training-free sparse attention mechanism that improves computational efficiency without sacrificing model accuracy. DELTA partitions transformer layers into three groups: initial layers that use full attention, a small set of \emph{$Δ$-layers} that identify salient tokens via aggregated head-level attention scores, and subsequent sparse-attention layers that attend only to the selected subset. This design preserves the full KV cache in GPU memory for accuracy, while avoiding expensive full-attention computation over many layers. On reasoning benchmarks such as AIME and GPQA-Diamond, DELTA matches or surpasses full attention in accuracy, while reducing the number of attended tokens by up to $4.25\times$ and delivering $1.54\times$ end-to-end speedup. Our results show that selective reuse of intermediate attention maps offers a robust path toward efficient long-context reasoning. The code is available at https://github.com/hoenza/DELTA.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑