Depth Memory
Not on the map. Why?
Abstract (arXiv)
Residual connections propagate information through a network by additively accumulating layer outputs. Recently proposed alternatives, such as Manifold-Constrained Hyper-Connections (mHC) and Attention Residuals (AttnRes), instead use more expressive depth aggregation mechanisms that improve language modeling performance at scale. In this work, we consider the mixing of representations over depth as a problem of storing and retrieving information across layers. Formalizing this perspective, we introduce Depth Memory (DM), a unified framework that describes the standard pre-layer-norm (PreLN) transformer, mHC, and AttnRes in terms of streams that carry representations through the network. One such stream, for example, could be an explicit memory stream that is queried to enrich the input to every layer, and whose output is subsequently written back into the memory for use by later layers. For AttnRes, this memory stream is a growing cache of explicit layer representations. For mHC, it is an expanded residual stream. Building on this view, we propose Linear Depth Memory (LDM), which formulates information retrieval across depth as a regression problem solved using recursive least squares. The resulting architecture propagates three streams across depth: the standard residual stream, a linear associative memory stream, and an inverse covariance stream. For high-throughput training and inference, we propose a hardware-aware implementation of LDM that reduces peak activation memory and memory traffic. LDM consistently achieves the lowest perplexities among PreLN, mHC and AttnRes baselines at the 400M and 1.5B parameter scales, alongside competitive zero-shot accuracy.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 38 of its 49 references that are in the map. First posted on arXiv 13 Oct 2026.
Builds on
38 of 49 references.
References · 38
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2025Qwen3 Technical Reportcited by 8,820
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
- 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
- 2020GLU Variants Improve Transformercited by 1,804
26 more
- 2019Root Mean Square Layer Normalizationcited by 1,480
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
- 2020On Layer Normalization in the Transformer Architecturecited by 922
- 2024OLMo: Accelerating the Science of Language Modelscited by 613
- 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 532
- 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 502
- 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 396
- 2017The Reversible Residual Network: Backpropagation Without Storing Activationscited by 217
- 2025Kimi Linear: An Expressive, Efficient Attention Architecturecited by 196
- 2023Uncovering mesa-optimization algorithms in Transformerscited by 100
- 2025mHC: Manifold-Constrained Hyper-Connectionscited by 88
- 2025DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Productscited by 75
- 2025Test-time regression: a unifying framework for designing sequence models with associative memorycited by 74
- 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
- 2018Reversible Recurrent Neural Networkscited by 23
- 2023Cross-Layer Retrospective Retrieving via Layer Attentioncited by 22
- 2026mHC-lite: You Don't Need 20 Sinkhorn-Knopp Iterationscited by 17
- 2025Residual Matrix Transformers: Scaling the Size of the Residual Streamcited by 12
- 2022Depth-Wise Attention (DWAtt): A Layer Fusion Method for Data-Efficient Classificationcited by 10
- 2026SiameseNorm: Breaking the Barrier to Reconciling Pre/Post-Normcited by 10
- 2025DeepCrossAttention: Supercharging Transformer Residual Connectionscited by 8
- 2026Preconditioned DeltaNet: Curvature-aware Sequence Modeling for Linear Recurrencescited by 7
- 2021Adapting MARBERT for Improved Arabic Dialect Identification: Submission to the NADI 2021 Shared Taskcited by 5
- 2026ReplaySSM: Cache SSM Inputs, Not Statecited by 2
- 2026DepthBench: Measuring How Residual Connections Enable More Computational Depthcited by 1
Built on by
Not cited yet.