研究 Transformer 表示演变的分解方法
Disentangling Representation Evolution in Transformers through Directional Decomposition
这是关于如何理解 Transformer 内部运作的论文,作者提出了一个分解方法,能解释模型如何更新表示,还能指导如何更鲁棒地编辑模型。
这项研究将 Transformer 中表示的演变分解为平行和垂直两个部分。在预训练模型中,发现除了残差路径之外,存在显著的平行分量。这种分解被应用于注意力更新和注意力值聚合,揭示了空间依赖的强不对称性:排除自身的值空间平行操作比残差空间和垂直操作更鲁棒。这种分解还用于诊断压缩引起的更新误差,其中垂直误差能更清晰地区分压缩方法。从零开始的预训练中,完全抑制全聚合的平行分量降低了验证损失轨迹并提高了下游性能,其中值空间的变体效果最强。
Disentangling Representation Evolution in Transformers through Directional Decomposition
Transformer representations evolve through learned additive transformations that either preserve their current direction or redirect it. We study this evolution as a functional geometry, decomposing learned updates into parallel and perpendicular components. Across pretrained models, we find substantial parallel components beyond the residual identity path. We then apply the decomposition in two spaces: to attention and MLP updates relative to the hidden state, and to attention value aggregation relative to the current token's value. Targeted edits reveal a strongly space-dependent asymmetry: exclude-self value-space parallel manipulation is markedly more robust than residual-space and perpendicular counterparts, preserving the direct self message while scaling only the non-self aggregate. The same decomposition gives a component-resolved description of compression-induced update error: perpendicular error separates compression methods more clearly than parallel error. Extensive experiments further demonstrate that full-aggregate parallel suppression during from-scratch pretraining lowers validation-loss trajectories and improves downstream averages, with the value-space variant strongest. Together, these results connect representation geometry to editing robustness, compression diagnosis, and training-time intervention. Code is available in the \href{https://github.com/Shwai-He/Transformer-Geometry}{project repository}.