仅用自注意力构建可解释的高效模型,性能接近主流Transformer。
Attention-Only Transformers via Unrolled Subspace Denoising
- 将表示学习视为在低维子空间中逐步去噪的过程,只保留必要组件。
- 每层以线性速率提升信号噪声比,层数越多效果越显著。
- 适合追求简洁、可解释模型的研究者与工程落地场景。
尽管Transformer在实践中广受欢迎,但其架构多为经验设计,缺乏数学依据和可解释性。许多实证研究指出,其部分组件可能冗余。本文认为表示学习的目标是将含噪的初始标记表示压缩至多个低维子空间的混合。为此,对应的去噪操作自然表现为多头(子空间)自注意力。通过将这种迭代去噪过程展开为深层网络,我们得到一个高度紧凑的架构,仅包含自注意力算子与层间跳跃连接。此外,我们证明每层均能高效去噪:随着层数增加,标记表示的信噪比呈线性提升。尽管结构极简,大量实验表明该模型在视觉与语言任务上性能接近GPT-2和CRATE等标准Transformer架构。
原文摘要 · Abstract (English)
Despite the popularity of transformers in practice, their architectures are empirically designed and neither mathematically justified nor interpretable. Moreover, as indicated by many empirical studies, some components of transformer architectures may be redundant. To derive a fully interpretable transformer architecture with only necessary components, we contend that the goal of representation learning is to compress a set of noisy initial token representations towards a mixture of low-dimensional subspaces. To compress these noisy token representations, an associated denoising operation naturally takes the form of a multi-head (subspace) self-attention. By unrolling such iterative denoising operations into a deep network, we arrive at a highly compact architecture that consists of \textit{only} self-attention operators with skip connections at each layer. Moreover, we show that each layer performs highly efficient denoising: it improves the signal-to-noise ratio of token representations \textit{at a linear rate} with respect to the number of layers. Despite its simplicity, extensive experiments on vision and language tasks demonstrate that such a transformer achieves performance close to that of standard transformer architectures such as GPT-2 and CRATE.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。