跳到正文
AI NEWS JOURNAL
arXiv cs.LGAI NEWS / JOURNAL

将Transformer理论付诸实践

arXiv:2610.32104v1 发布类型:新 摘要:为刻画Transformer架构的能力与局限性,人们已发展出若干形式化理论,这些理论各自采用不同的抽象方法,以捕捉该架构的不同特性。由于其底层假设与概念框架存在差异,这些理论在预测Transformer对哪些任务较为容易或困难时往往意见不一。我们梳理了七种关于Transformer能力的理论(Star-free、$\mathsf{AC}^0$、$\mathsf{TC}^0$、C-RASP、MPC、BAPO以及敏感性),并将其研究结果转化为一张通用的预测矩阵,覆盖一系列涉及不同计算结构的任务。我们还提供了新的理论成果,以完善这一矩阵。随后,我们对这些理论进行评估

对应语言译文排队中,完成后自动更新。

Abstract:Several formal theories have been developed to characterize the capabilities and limitations of the transformer architecture, each employing different abstractions that capture different features of the architecture. Due to the differences in their underlying assumptions and conceptual frameworks, these theories can disagree in their predictions about what tasks transformers find easy or hard. We map out seven theories of transformer capability (Star-free, $\mathsf{AC}^0$, $\mathsf{TC}^0$, C-RASP, MPC, BAPO, and Sensitivity) and translate their results into a common matrix of predictions across a suite of tasks covering different computational structures. We provide new theoretical results to complete this matrix. We then evaluate theoretical predictions through controlled experiments measuring in-distribution sample complexity, length generalization, and pretrained language model performance. We find that no single theory explains the observed pattern of successes and failures. When a theory does not capture the transformer behaviors relevant to a task, its predictions break down; for instance, we show that the $k$-hop induction task is predicted hard by C-RASP because it does not model content-dependent attention, but we train small transformers on this task that length-generalize. Similarly, theories assuming hard attention like $\mathsf{AC}^0$ and BAPO predict binary majority to be hard, for which we also find success in practice. Together, our results point to several specific features that a theory of transformers must capture: soft rather than hard attention, dynamic content-dependent retrieval, bounded computation at each position, an account of learnability and inductive biases, and a combination of upper and lower bounds.

Submission history

Access Paper:

View PDF

HTML (experimental)

TeX Source

Additional Features

Audio Summary

Current browse context:

References & Citations

Google Scholar

Semantic Scholar

Bookmark

Institution

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

资料来源

arXiv cs.LG
← 继续阅读全部动态