Scaling Adaptive Depth with Norm-Agnostic Residual Networks
Not on the map. Why?
Abstract (arXiv)
Residual architectures are ubiquitous in deep learning, but they suffer from a subtle structural limitation: the norm of the residual stream can grow rapidly with depth. As a result, updates from later layers become small relative to the accumulated residual state. This reduces their impact on the representation and limits the benefits of scaling models in depth. To address this, we introduce NAG, a norm-agnostic residual architecture that separates magnitude from directional information in the residual stream, preserving meaningful layer contributions throughout depth and preventing later updates from being systematically suppressed by residual-norm growth. Importantly, NAG introduces only a negligible number of additional parameters and relies on simple operations that are easily kernel-fusible, preserving training efficiency in practice. We show that this architecture outperforms baseline Transformers, with gains that increase substantially as depth grows, enabling effective training of much deeper models. The norm-agnostic formulation also leads to an interpretable Mixture-of-Depths (MoD) mechanism that adaptively skips both attention and MLP layers. Beyond serving as a post-training accuracy-compute tradeoff, this mechanism can be used as a pretraining-time scaling strategy: under iso-FLOP training, compute saved by reducing per-token forward-pass cost can be reinvested into training on more tokens while keeping the total parameter count and KV-cache budget fixed. In our experiments, moderate Mixture-of-Depths rates of approximately 20%-25% match full-depth baseline performance under equal training compute while substantially reducing the number of executed layer parameters and forward-pass FLOPs. These results identify sparsity in depth as a new scaling axis for fixed-compute training, enabling very deep yet FLOP-efficient models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 51 of its 60 references that are in the map. First posted on arXiv 15 Jun 2026.
Builds on
51 of 60 references.
References · 51
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023GPT-4 Technical Reportcited by 18,132
- 2016Layer Normalizationcited by 5,579
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2020On Layer Normalization in the Transformer Architecturecited by 906
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2021Going deeper with Image Transformerscited by 759
38 more
- 2021CogView: Mastering Text-to-Image Generation via Transformerscited by 691
- 2018Universal Transformerscited by 613
- 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 579
- 2022Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Spacecited by 522
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 372
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2024Massive Activations in Large Language Modelscited by 277
- 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 266
- 2020ReZero is All You Need: Fast Convergence at Large Depthcited by 260
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
- 2019Depth-Adaptive Transformercited by 227
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 219
- 2024When Attention Sink Emerges in Language Models: An Empirical Viewcited by 200
- 2022DeepNet: Scaling Transformers to 1,000 Layerscited by 176
- 2015Training Very Deep Networkscited by 172
- 2023Quantizable Transformers: Removing Outliers by Helping Attention Heads Do Nothingcited by 147
- 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 124
- 2025Why do LLMs attend to the first token?cited by 122
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 120
- 2020On the Effect of Dropping Layers of Pre-trained Transformer Modelscited by 118
- 2017Residual Connections Encourage Iterative Inferencecited by 74
- 2023Outlier Suppression+: Accurate quantization of large language models by equivalent and optimal shifting and scalingcited by 62
- 2019Improving Deep Transformer with Depth-Scaled Initialization and Merged Attentioncited by 59
- 2025The Curse of Depth in Large Language Modelscited by 58
- 2024MoEUT: Mixture-of-Experts Universal Transformerscited by 55
- 2016Highway and Residual Networks learn Unrolled Iterative Estimationcited by 52
- 2025Do Language Models Use Their Depth Efficiently?cited by 48
- 2024Tracing Representation Progression: Analyzing and Enhancing Layer-Wise Similaritycited by 36
- 2024Prefixing Attention Sinks can Mitigate Activation Outliers for Large Language Model Quantizationcited by 33
- 2023On the Expressivity Role of LayerNorm in Transformers' Attentioncited by 32
- 2023ResiDual: Transformer with Dual Residual Connectionscited by 30
- 2024Zyda-2: a 5 Trillion Token High-Quality Datasetcited by 12
- 2026LatentMoE: Toward Optimal Accuracy per FLOP and Parameter in Mixture of Expertscited by 12
- 2025Compressed Convolutional Attention: Efficient Attention in a Compressed Latent Spacecited by 5
- 2025Training Foundation Models on a Full-Stack AMD Platform: Compute, Networking, and System Designcited by 5
- 2026ZAYA1-8B Technical Reportcited by 4
50 most cited of 51 All 51 (JSON)
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Optimal Depth of Neural Networks
- 2026ANCRe: Adaptive Neural Connection Reassignment for Efficient Depth Scaling
- 2026Gradient Smoothing: Coupling Layer-wise Updates for Improved Optimization
- 2025FAIR-Pruner: A Flexible Framework for Automatic Layer-Wise Pruning via Tolerance of Difference
- 2026When Do Early-Exit Networks Generalize? A PAC-Bayesian Theory of Adaptive Depth
- 2026Scaling DoRA: High-Rank Adaptation via Factored Norms and Fused Kernels
- 2026LayerRoPE: Dynamic Depth-wise Magnitude & Angular Superposition
- 2024Neural Residual Diffusion Models for Deep Scalable Vision Generation