跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2602.19143 · v3

Incremental Learning of Sparse Attention Patterns in Transformers

首次提交 2026-02-22 20:16
版本更新 2026-11-11 03:00
雷达观测 2026-11-13 11:12
arXiv ↗PDF ↗

摘要

Transformers integrate information from multiple past positions through sparse attention patterns that copy from specific locations. We study how these patterns form during training in a high-order Markov-chain setting, where the next token depends on several groups of past positions with differing statistical importance. Learning proceeds in discrete stages, each marked by the emergence of a sparse attention pattern for the next most important group. The dynamics are initially competitive, with all attention heads focusing on the dominant pattern, but later become cooperative, with different heads specializing in distinct patterns. For a tractable surrogate, the dynamics reduce to those of a tensor factorization problem, enabling us to prove stagewise convergence. Empirically, the number of stages completed depends on training set size, suggesting a form of implicit complexity control through early stopping. Overall, we give a theoretical account of how structured attention patterns and head specialization emerge without an explicit curriculum.

作者备注:Published at ICML 2026. OpenReview: https://openreview.net/forum?id=vSRh1qU5sH. 55 pages, 21 figures. v3: revised proofs in the appendix, with explicit assumptions in Theorems 4 and 5

期刊信息:Proceedings of the 43rd International Conference on Machine Learning (ICML 2026)

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-11 03:00 · 最新观测版本

Incremental Learning of Sparse Attention Patterns in Transformers

Transformers integrate information from multiple past positions through sparse attention patterns that copy from specific locations. We study how these patterns form during training in a high-order Markov-chain setting, where the next token depends on several groups of past positions with differing statistical importance. Learning proceeds in discrete stages, each marked by the emergence of a sparse attention pattern for the next most important group. The dynamics are initially competitive, with all attention heads focusing on the dominant pattern, but later become cooperative, with different heads specializing in distinct patterns. For a tractable surrogate, the dynamics reduce to those of a tensor factorization problem, enabling us to prove stagewise convergence. Empirically, the number of stages completed depends on training set size, suggesting a form of implicit complexity control through early stopping. Overall, we give a theoretical account of how structured attention patterns and head specialization emerge without an explicit curriculum.

查看此版本解读 →查看此版本原文 ↗