mlsanityData to 14 Oct 2026

Understanding Dynamics of Nonlinear Representation Learning and Its Application

arXiv 2106.14836 ↗First posted 28 Jun 2021cs.LG cs.CV math.OCcited by 11

Not on the map. Why?

Abstract (arXiv)

Representations of the world environment play a crucial role in artificial intelligence. It is often inefficient to conduct reasoning and inference directly in the space of raw sensory representations, such as pixel values of images. Representation learning allows us to automatically discover suitable representations from raw sensory data. For example, given raw sensory data, a deep neural network learns nonlinear representations at its hidden layers, which are subsequently used for classification (or regression) at its output layer. This happens implicitly during training through minimizing a supervised or unsupervised loss in common practical regimes of deep learning, unlike the neural tangent kernel (NTK) regime. In this paper, we study the dynamics of such implicit nonlinear representation learning, which is beyond the NTK regime. We identify a pair of a new assumption and a novel condition, called the common model structure assumption and the data-architecture alignment condition. Under the common model structure assumption, the data-architecture alignment condition is shown to be sufficient for the global convergence and necessary for the global optimality. Moreover, our theory explains how and when increasing the network size does and does not improve the training behaviors in the practical regime. Our results provide practical guidance for designing a model structure: e.g., the common model structure assumption can be used as a justification for using a particular model structure instead of others. We also derive a new training framework based on the theory. The proposed framework is empirically shown to maintain competitive (practical) test performances while providing global convergence guarantees for deep residual neural networks with convolutions, skip connections, and batch normalization with standard benchmark datasets, including CIFAR-10, CIFAR-100, and SVHN.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 16 of its 53 references that are in the map. First posted on arXiv 28 Jun 2021.

Builds on

16 of 53 references.

References · 16

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  3. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  4. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
  5. 2018Deep Learning for Classical Japanese Literaturecited by 422
  6. 2016Deep Learning without Poor Local Minimacited by 234
  7. 2017Deep Photo Style Transfercited by 168
  8. 2017Deep linear neural networks with arbitrary loss: All local minima are globalcited by 65
  9. 2021Optimization of Graph Neural Networks: Implicit Acceleration by Skip Connections and More Depthcited by 55
  10. 2018Gradient descent with identity initialization efficiently learns positive definite linear transformations by deep residual networkscited by 44
  11. 2021On the Theory of Implicit Deep Learning: Global Convergence with Implicit Layerscited by 35
  12. 2017Theory of Deep Learning III: explaining the non-overfitting puzzlecited by 32
4 more
  1. 2020On the Global Convergence of Training Deep Linear ResNetscited by 29
  2. 2016Bayesian Optimization with Exponential Convergencecited by 18
  3. 2016Global Continuous Optimization with Error Bound and Fast Convergencecited by 8
  4. 2021A Recipe for Global Convergence Guarantee in Deep Neural Networkscited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 5; 2023: 4; 2024: 0; 2025: 0; 2026: 1.

11 papers.