mlsanityData to 14 Oct 2026

Identity Matters in Deep Learning

arXiv 1611.04231 ↗First posted 14 Nov 2016cs.LG cs.NE stat.MLcited by 109

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

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 30; 2022: 28; 2023: 19; 2024: 14; 2025: 8; 2026: 10.

109 papers.

Sort:

By area:

  1. 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,167
  2. 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 227
  3. 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 174
  4. 2021Towards Understanding Knowledge Distillationcited by 158
  5. 2023Cache Me if You Can: Accelerating Diffusion Models through Block Cachingcited by 151
  6. 2021Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformerscited by 102
  7. 2023The Expressive Power of Low-Rank Adaptationcited by 102
  8. 2021Optimization of Graph Neural Networks: Implicit Acceleration by Skip Connections and More Depthcited by 55
  9. 2021Exploring Counterfactual Explanations Through the Lens of Adversarial Examples: A Theoretical and Empirical Analysiscited by 52
  10. 2023Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?cited by 47
  11. 2022Architecture Matters in Continual Learningcited by 46
  12. 2021On the Optimal Memorization Power of ReLU Neural Networkscited by 40
38 more
  1. 2022Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscapecited by 39
  2. 2023On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysiscited by 39
  3. 2021On the Theory of Implicit Deep Learning: Global Convergence with Implicit Layerscited by 35
  4. 2022Understanding Deep Contrastive Learning via Coordinate-wise Optimizationcited by 35
  5. 2024Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNscited by 34
  6. 2023Universality and Limitations of Prompt Tuningcited by 30
  7. 2021ZerO Initialization: Initializing Neural Networks with only Zeros and Onescited by 28
  8. 2021Geometry of Linear Convolutional Networkscited by 27
  9. 2021Regular Polytope Networkscited by 24
  10. 2021The loss landscape of deep linear neural networks: a second-order analysiscited by 24
  11. 2022Exact Solutions of a Deep Linear Networkcited by 24
  12. 2022Convergence of gradient descent for deep neural networkscited by 24
  13. 2022Designing Universal Causal Deep Learning Models: The Geometric (Hyper)Transformercited by 22
  14. 2021Augmenting Deep Classifiers with Polynomial Neural Networkscited by 21
  15. 2021Proxy Convexity: A Unified Framework for the Analysis of Neural Networks Trained by Gradient Descentcited by 21
  16. 2022Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Functioncited by 20
  17. 2023Beyond NTK with Vanilla Gradient Descent: A Mean-Field Analysis of Neural Networks with Polynomial Width, Samples, and Timecited by 20
  18. 2021Noether: The More Things Change, the More Stay the Samecited by 19
  19. 2022Posterior Collapse of a Linear Latent Variable Modelcited by 18
  20. 2022An Analysis of Attention via the Lens of Exchangeability and Latent Variable Modelscited by 16
  21. 2023Reusing Pretrained Models by Multi-linear Operators for Efficient Trainingcited by 15
  22. 2021An Exponential Improvement on the Memorization Capacity of Deep Threshold Networkscited by 14
  23. 2021CoReS: Compatible Representations via Stationaritycited by 14
  24. 2022Stability and Generalization for Markov Chain Stochastic Gradient Methodscited by 14
  25. 2022From Perception to Programs: Regularize, Overparameterize, and Amortizecited by 13
  26. 2023Unified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methodscited by 12
  27. 2021When Are Solutions Connected in Deep Networks?cited by 11
  28. 2022Transforming PageRank into an Infinite-Depth Graph Neural Networkcited by 11
  29. 2024S2FT: Efficient, Scalable and Generalizable LLM Fine-tuning by Structured Sparsitycited by 10
  30. 2022On Measuring Excess Capacity in Neural Networkscited by 9
  31. 2022Task Discovery: Finding the Tasks that Neural Networks Generalize oncited by 9
  32. 2024Interplay between depth and width for interpolation in neural ODEscited by 9
  33. 2021Why Do Local Methods Solve Nonconvex Problems?cited by 8
  34. 2021Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activationscited by 7
  35. 2022Piecewise Linear Neural Networks and Deep Learningcited by 7
  36. 2023Critical Points and Convergence Analysis of Generative Deep Linear Networks Trained with Bures-Wasserstein Losscited by 7
  37. 2023Beyond Vanilla Variational Autoencoders: Detecting Posterior Collapse in Conditional and Hierarchical Variational Autoencoderscited by 7
  38. 2025Gradient Descent with Large Step Sizes: Chaos and Fractal Convergence Regioncited by 7

50 most cited of 109 All 109 (JSON)