Identity Matters in Deep Learning
Not on the map. Why?
Abstract (arXiv)
An emerging design principle in deep learning is that each layer of a deep artificial neural network should be able to easily express the identity transformation. This idea not only motivated various normalization techniques, such as batch normalization, but was also key to the immense success of residual networks. In this work, we put the principle of identity parameterization on a more solid theoretical footing alongside further empirical progress. We first give a strikingly simple proof that arbitrarily deep linear residual networks have no spurious local optima. The same result for linear feed-forward networks in their standard parameterization is substantially more delicate. Second, we show that residual networks with ReLu activations have universal finite-sample expressivity in the sense that the network can represent any function of its sample provided that the model has more parameters than the sample size. Directly inspired by our theory, we experiment with a radically simple residual architecture consisting of only residual convolutional layers and ReLu activations, but no batch normalization, dropout, or max pool. Our model improves significantly on previous all-convolutional networks on the CIFAR10, CIFAR100, and ImageNet classification benchmarks.
Key facts. Cited by 109 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Nov 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 30; 2022: 28; 2023: 19; 2024: 14; 2025: 8; 2026: 10.
109 papers.
Sort:
By area:
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,167
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 227
- 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 174
- 2021Towards Understanding Knowledge Distillationcited by 158
- 2023Cache Me if You Can: Accelerating Diffusion Models through Block Cachingcited by 151
- 2021Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformerscited by 102
- 2023The Expressive Power of Low-Rank Adaptationcited by 102
- 2021Optimization of Graph Neural Networks: Implicit Acceleration by Skip Connections and More Depthcited by 55
- 2021Exploring Counterfactual Explanations Through the Lens of Adversarial Examples: A Theoretical and Empirical Analysiscited by 52
- 2023Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?cited by 47
- 2022Architecture Matters in Continual Learningcited by 46
- 2021On the Optimal Memorization Power of ReLU Neural Networkscited by 40
38 more
- 2022Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscapecited by 39
- 2023On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysiscited by 39
- 2021On the Theory of Implicit Deep Learning: Global Convergence with Implicit Layerscited by 35
- 2022Understanding Deep Contrastive Learning via Coordinate-wise Optimizationcited by 35
- 2024Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNscited by 34
- 2023Universality and Limitations of Prompt Tuningcited by 30
- 2021ZerO Initialization: Initializing Neural Networks with only Zeros and Onescited by 28
- 2021Geometry of Linear Convolutional Networkscited by 27
- 2021Regular Polytope Networkscited by 24
- 2021The loss landscape of deep linear neural networks: a second-order analysiscited by 24
- 2022Exact Solutions of a Deep Linear Networkcited by 24
- 2022Convergence of gradient descent for deep neural networkscited by 24
- 2022Designing Universal Causal Deep Learning Models: The Geometric (Hyper)Transformercited by 22
- 2021Augmenting Deep Classifiers with Polynomial Neural Networkscited by 21
- 2021Proxy Convexity: A Unified Framework for the Analysis of Neural Networks Trained by Gradient Descentcited by 21
- 2022Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Functioncited by 20
- 2023Beyond NTK with Vanilla Gradient Descent: A Mean-Field Analysis of Neural Networks with Polynomial Width, Samples, and Timecited by 20
- 2021Noether: The More Things Change, the More Stay the Samecited by 19
- 2022Posterior Collapse of a Linear Latent Variable Modelcited by 18
- 2022An Analysis of Attention via the Lens of Exchangeability and Latent Variable Modelscited by 16
- 2023Reusing Pretrained Models by Multi-linear Operators for Efficient Trainingcited by 15
- 2021An Exponential Improvement on the Memorization Capacity of Deep Threshold Networkscited by 14
- 2021CoReS: Compatible Representations via Stationaritycited by 14
- 2022Stability and Generalization for Markov Chain Stochastic Gradient Methodscited by 14
- 2022From Perception to Programs: Regularize, Overparameterize, and Amortizecited by 13
- 2023Unified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methodscited by 12
- 2021When Are Solutions Connected in Deep Networks?cited by 11
- 2022Transforming PageRank into an Infinite-Depth Graph Neural Networkcited by 11
- 2024S2FT: Efficient, Scalable and Generalizable LLM Fine-tuning by Structured Sparsitycited by 10
- 2022On Measuring Excess Capacity in Neural Networkscited by 9
- 2022Task Discovery: Finding the Tasks that Neural Networks Generalize oncited by 9
- 2024Interplay between depth and width for interpolation in neural ODEscited by 9
- 2021Why Do Local Methods Solve Nonconvex Problems?cited by 8
- 2021Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activationscited by 7
- 2022Piecewise Linear Neural Networks and Deep Learningcited by 7
- 2023Critical Points and Convergence Analysis of Generative Deep Linear Networks Trained with Bures-Wasserstein Losscited by 7
- 2023Beyond Vanilla Variational Autoencoders: Detecting Posterior Collapse in Conditional and Hierarchical Variational Autoencoderscited by 7
- 2025Gradient Descent with Large Step Sizes: Chaos and Fractal Convergence Regioncited by 7
50 most cited of 109 All 109 (JSON)
- 2026Convergence of Gradient Descent for General Neural Network Architectures Beyond the NTK Regime22 Jun 2026
- 2026Attention is Just Another Name for Coupling? A Fast-Slow ODE Perspective on Hierarchical Pretraining15 Jun 2026
- 2026The Quantization Benefits of Residual-Free Transformers25 May 2026
- 2026Progressive Approximation in Deep Residual Networks: Theory and Validation27 Apr 2026
- 2026Universal Approximation Constraints of Narrow ResNets: The Tunnel Effect30 Mar 2026
- 2026On the Loss Landscape Geometry of Regularized Deep Matrix Factorization: Uniqueness and Sharpness28 Mar 2026
- 2026Feature Resemblance: Towards a Theoretical Understanding of Analogical Reasoning in Transformers5 Mar 2026
- 2026ANCRe: Adaptive Neural Connection Reassignment for Efficient Depth Scaling9 Feb 2026
- 2026TextResNet: Decoupling and Routing Optimization Signals in Compound AI Systems via Deep Residual Tuning9 Feb 2026
- 2026On the Infinite Width and Depth Limits of Predictive Coding Networks7 Feb 2026
- 2025Analyzing the Power of Chain of Thought through Memorization Capabilities3 Nov 2025
- 2025Gradient Descent with Large Step Sizes: Chaos and Fractal Convergence Region29 Sep 2025
38 more
- 2025Meta Fusion: A Unified Framework For Multimodality Fusion with Mutual Learning27 Jul 2025
- 2025Data Uniformity Improves Training Efficiency and More, with a Convergence Framework Beyond the NTK Regime30 Jun 2025
- 2025On the Convergence of Gradient Descent on Learning Transformers with Residual Connections5 Jun 2025
- 2025Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles4 May 2025
- 2025A Good Start Matters: Enhancing Continual Learning with Data-Driven Weight Initialization9 Mar 2025
- 2025IDInit: A Universal and Stable Initialization Method for Neural Network Training6 Mar 2025
- 2024S2FT: Efficient, Scalable and Generalizable LLM Fine-tuning by Structured Sparsity9 Dec 2024
- 2024Generalizability of Memorization Neural Networks1 Nov 2024
- 2024Towards Sharper Risk Bounds for Minimax Problems11 Oct 2024
- 2024Constructive Universal Approximation and Finite Sample Memorization by Narrow Deep ReLU Networks10 Sep 2024
- 2024Lecture Notes on Linear Neural Networks: A Tale of Optimization and Generalization in Deep Learning25 Aug 2024
- 2024Algebraic Representations for Faster Predictions in Convolutional Neural Networks14 Aug 2024
- 2024Memorization Capacity for Additive Fine-Tuning with Small ReLU Networks1 Aug 2024
- 2024Exploring Loss Landscapes through the Lens of Spin Glass Theory30 Jul 2024
- 2024Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNs5 Jun 2024
- 2024Neural Parameter Regression for Explicit Representations of PDE Solution Operators19 Mar 2024
- 2024Stacking as Accelerated Gradient Descent8 Mar 2024
- 2024Fixed width treelike neural networks capacity analysis -- generic activations8 Feb 2024
- 2024On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Lojasiewicz Condition4 Feb 2024
- 2024Interplay between depth and width for interpolation in neural ODEs18 Jan 2024
- 2023Cluster-based classification with neural ODEs via control21 Dec 2023
- 2023Lifted RDT based capacity analysis of the 1-hidden layer treelike sign perceptrons neural networks13 Dec 2023
- 2023Capacity of the treelike sign perceptrons neural networks with one hidden layer -- RDT based upper bounds13 Dec 2023
- 2023Cache Me if You Can: Accelerating Diffusion Models through Block Caching6 Dec 2023
- 2023The Expressive Power of Low-Rank Adaptation26 Oct 2023
- 2023Gradient Descent Fails to Learn High-frequency Functions and Modular Arithmetic19 Oct 2023
- 2023Reusing Pretrained Models by Multi-linear Operators for Efficient Training16 Oct 2023
- 2023A Homogenization Approach for Gradient-Dominated Stochastic Optimization21 Aug 2023
- 2023Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?26 Jul 2023
- 2023Beyond NTK with Vanilla Gradient Descent: A Mean-Field Analysis of Neural Networks with Polynomial Width, Samples, and Time28 Jun 2023
- 2023Beyond Vanilla Variational Autoencoders: Detecting Posterior Collapse in Conditional and Hierarchical Variational Autoencoders8 Jun 2023
- 2023Combining Explicit and Implicit Regularization for Efficient Learning in Deep Networks1 Jun 2023
- 2023Universality and Limitations of Prompt Tuning30 May 2023
- 2023Memorization Capacity of Neural Networks with Conditional Computation20 Mar 2023
- 2023QuickSRNet: Plain Single-Image Super-Resolution Architecture for Faster Inference on Mobile Platforms8 Mar 2023
- 2023Critical Points and Convergence Analysis of Generative Deep Linear Networks Trained with Bures-Wasserstein Loss6 Mar 2023
- 2023Unified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methods23 Feb 2023
- 2023Maximally Compact and Separated Features with Regular Polytope Networks15 Jan 2023
50 newest of 109 All 109 (JSON)
- 2023Cache Me if You Can: Accelerating Diffusion Models through Block Cachingcited by 151
- 2023The Expressive Power of Low-Rank Adaptationcited by 102
- 2023Cache Me if You Can: Accelerating Diffusion Models through Block Caching6 Dec 2023
- 2023The Expressive Power of Low-Rank Adaptation26 Oct 2023
- 2021Towards Understanding Knowledge Distillationcited by 158
- 2021Towards Understanding Knowledge Distillation27 May 2021
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,167
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 227
- 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 174
- 2021Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformerscited by 102
- 2021Optimization of Graph Neural Networks: Implicit Acceleration by Skip Connections and More Depthcited by 55
- 2021Exploring Counterfactual Explanations Through the Lens of Adversarial Examples: A Theoretical and Empirical Analysiscited by 52
- 2023Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?cited by 47
- 2022Architecture Matters in Continual Learningcited by 46
- 2021On the Optimal Memorization Power of ReLU Neural Networkscited by 40
- 2022Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscapecited by 39
- 2023On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysiscited by 39
- 2021On the Theory of Implicit Deep Learning: Global Convergence with Implicit Layerscited by 35
12 most cited of 104 All 104 (JSON)
- 2026Convergence of Gradient Descent for General Neural Network Architectures Beyond the NTK Regime22 Jun 2026
- 2026Attention is Just Another Name for Coupling? A Fast-Slow ODE Perspective on Hierarchical Pretraining15 Jun 2026
- 2026The Quantization Benefits of Residual-Free Transformers25 May 2026
- 2026Progressive Approximation in Deep Residual Networks: Theory and Validation27 Apr 2026
- 2026Universal Approximation Constraints of Narrow ResNets: The Tunnel Effect30 Mar 2026
- 2026On the Loss Landscape Geometry of Regularized Deep Matrix Factorization: Uniqueness and Sharpness28 Mar 2026
- 2026ANCRe: Adaptive Neural Connection Reassignment for Efficient Depth Scaling9 Feb 2026
- 2026TextResNet: Decoupling and Routing Optimization Signals in Compound AI Systems via Deep Residual Tuning9 Feb 2026
- 2026On the Infinite Width and Depth Limits of Predictive Coding Networks7 Feb 2026
- 2025Gradient Descent with Large Step Sizes: Chaos and Fractal Convergence Region29 Sep 2025
- 2025Meta Fusion: A Unified Framework For Multimodality Fusion with Mutual Learning27 Jul 2025
- 2025Data Uniformity Improves Training Efficiency and More, with a Convergence Framework Beyond the NTK Regime30 Jun 2025
12 newest of 104 All 104 (JSON)