Transformer 无法动态追踪状态,新架构建议用循环机制解决。
The Topological Trouble With Transformers
- 用循环结构替代纯前馈,实现状态的持续更新
- 深度受限导致浅层信息不可用,影响长期依赖建模
- 适合研究认知模型与长序列建模的学者
Transformers 通过扩展上下文历史编码序列结构,但其纯前馈架构从根本上限制了动态状态追踪能力。状态追踪——即对随时间演化的环境进行隐变量迭代更新——涉及固有的序列依赖性,而前馈网络难以维持。因此,前馈模型将演化状态表示不断推向深层,使浅层信息不可访问,最终耗尽模型深度。尽管可通过动态深度模型或显式/隐式思维来外化状态表示绕过此限制,但这些方法计算与内存效率低下。本文主张,时间延展的认知应从显式思维痕迹转向隐式激活动态,采用循环架构。我们提出一种循环与连续思维 Transformer 的分类体系,按循环轴(深度或步数)及输入标记与循环步数比进行划分。最后,展望增强的状态空间模型与粗粒度循环等未来方向,以更好整合状态追踪至现代基础模型中。
原文摘要 · Abstract (English)
Transformers encode structure in sequences via an expanding contextual history. However, their purely feedforward architecture fundamentally limits dynamic state tracking. State tracking -- the iterative updating of latent variables reflecting an evolving environment -- involves inherently sequential dependencies that feedforward networks struggle to maintain. Consequently, feedforward models push evolving state representations deeper into their layer stack with each new input step, rendering information inaccessible in shallow layers and ultimately exhausting the model's depth. While this depth limit can be bypassed by dynamic depth models and by explicit or latent thinking that externalizes state representations, these solutions are computationally and memory inefficient. In this article, we argue that temporally extended cognition requires refocusing from explicit thought traces to implicit activation dynamics via recurrent architectures. We introduce a taxonomy of recurrent and continuous-thought transformer architectures, categorizing them by their recurrence axis (depth versus step) and their ratio of input tokens to recurrence steps. Finally, we outline promising research directions, including enhanced state-space models and coarse-grained recurrence, to better integrate state tracking into modern foundation models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。