Transformers with Selective Access to Early Representations
Not on the map. Why?
Abstract (arXiv)
Several recent Transformer architectures expose later layers to representations computed in the earliest layers, motivated by the observation that low-level features can become harder to recover as the residual stream is repeatedly transformed through depth. The cheapest among these methods add static value residuals: learned mixing coefficients that expose the first-layer value projection V_1 uniformly across tokens and heads. More expressive dense or dynamic alternatives recover finer-grained access, but at higher memory cost and lower throughput. The usefulness of V_1 is unlikely to be constant across tokens, heads, and contexts; different positions plausibly require different amounts of access to early lexical or semantic information. We therefore treat early-representation reuse as a retrieval problem rather than a connectivity problem, and introduce Selective Access Transformer (SATFormer), which preserves the first-layer value pathway while controlling access with a context-dependent gate. Across models from 130M to 1.3B parameters, SATFormer consistently improves validation loss and zero-shot accuracy over the static value-residual and Transformer baselines. Its strongest gains appear on retrieval-intensive benchmarks, where it improves over static value residuals by approximately 1.5 average points, while maintaining throughput and memory usage close to the baseline Transformer. Gate analyses suggest sparse, depth-dependent, head-specific, and category-sensitive access patterns, supporting the interpretation that SATFormer learns selective reuse of early representations rather than uniform residual copying. Our code is available at https://github.com/SkyeGunasekaran/SATFormer.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 18 of its 18 references that are in the map. First posted on arXiv 5 May 2026.
Builds on
18 of 18 references.
References · 18
- 2025Qwen3 Technical Reportcited by 8,820
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2018Deep contextualized word representationscited by 2,290
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
- 2021Going deeper with Image Transformerscited by 764
- 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 532
- 2020ReZero is All You Need: Fast Convergence at Large Depthcited by 264
- 2015Highway Networkscited by 260
- 2022DeepNet: Scaling Transformers to 1,000 Layerscited by 178
- 2025mHC: Manifold-Constrained Hyper-Connectionscited by 88
- 2026Attention Residualscited by 65
6 more
- 2024Just read twice: closing the recall gap for recurrent language modelscited by 60
- 2024DenseFormer: Enhancing Information Flow in Transformers via Depth Weighted Averagingcited by 53
- 2025MUDDFormer: Breaking Residual Bottlenecks in Transformers via Multiway Dynamic Dense Connectionscited by 31
- 2024Value Residual Learningcited by 27
- 2023Cross-Layer Retrospective Retrieving via Layer Attentioncited by 22
- 2024LAuReL: Learned Augmented Residual Layercited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.