paper-with-me

홈 › Papers

Residual Stream Duality in Modern Transformer Architectures

2026-03-17 · Yifan Zhang arxiv

Recent work has made clear that the residual pathway is not mere optimization plumbing; it is part of the model's representational machinery. We agree, but argue that the cleanest way to organize this design space is through a two-axis view of the Transformer. A decoder evolves information along two ordered dimensions: sequence position and layer depth. Self-attention already provides adaptive mixing along the sequence axis, whereas the residual stream usually performs fixed addition along the depth axis. If we fix a token position and treat layer index as the ordered variable, then a causal depth-wise residual attention read is exactly the same local operator as causal short sliding-window attention (ShortSWA), except written over depth rather than over sequence. This is the core residual stream duality behind Transformer$^2$. This perspective also clarifies the recent literature. ELC-BERT and DenseFormer already show that learned aggregation over depth can outperform uniform residual accumulation, while Vertical Attention, DeepCrossAttention (DCA), MUDDFormer, and Attention Residuals move further toward explicit attention-based routing over earlier layers. The key point, however, is that operator-level duality does not imply systems-level symmetry. For large-scale autoregressive models, sequence-axis ShortSWA is usually the more hardware-friendly placement because it reuses token-side sliding-window kernels, KV-cache layouts, and chunked execution. If the goal is instead to change the shortcut itself, Deep Delta Learning (DDL) is the cleaner intervention because it modifies the residual operator directly rather than adding a separate cross-layer retrieval path. Our recommendation is therefore simple: use DDL when the shortcut is the object of interest, and use sequence-axis ShortSWA when the goal is local adaptive mixing.

📄 PDF Abstract BibTeX arXiv:2603.16039

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Entropy-Lens: The Information Signature of Transformer Computations

2025-02-23 · Riccardo Ali, Francesco Caso, Christopher Irwin, Pietro Liò

Transformer models have revolutionized fields from natural language processing to computer vision, yet their internal computational dynamics remain poorly understood raising concerns about predictability and robustness. …

Residual Gated Graph ConvNets

2017-11-20 · ICLR 2018 1 · Xavier Bresson, Thomas Laurent

Graph-structured data such as social networks, functional brain networks, gene regulatory networks, communications networks have brought the interest in generalizing deep learning techniques to graph domains. In this pap…

ClusteringGeneral ClassificationGraph ClassificationGraph Clustering+3

Progressive Residual Warmup for Language Model Pretraining

2026-03-05 · Tianhao Chen, Xin Xu, Lu Yin, Hao Chen 외 arxiv

Transformer architectures serve as the backbone for most modern Large Language Models, therefore their pretraining stability and convergence speed are of central concern. Motivated by the logical dependency of sequential…

ResLRP: The Role of Residual Cancellation in Attribution Instability in Vision Transformers

2026-09-15 · Jim Berend, Reduan Achtibat, Daniel Schäffer, Alexander Binder 외 arxiv

Vision Transformers (ViTs) are central to most modern vision models, yet obtaining input attributions that are fine-grained, faithful, and stable remains challenging. Layer-wise Relevance Propagation (LRP) has been adapt…

SiameseNorm: Breaking the Barrier to Reconciling Pre/Post-Norm

2026-02-08 · Tianyu Li, Dongchen Han, Zixuan Cao, Haofeng Huang 외 arxiv

The long-standing tension between Pre- and Post-Norm remains an open problem in Transformer architecture, reflecting a fundamental trade-off between training stability and representational capacity. Prior attempts to com…