Understanding Dynamics of Nonlinear Representation Learning and Its Application
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
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2016Identity Mappings in Deep Residual Networkscited by 1,965
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
- 2018Deep Learning for Classical Japanese Literaturecited by 422
- 2016Deep Learning without Poor Local Minimacited by 234
- 2017Deep Photo Style Transfercited by 168
- 2017Deep linear neural networks with arbitrary loss: All local minima are globalcited by 65
- 2021Optimization of Graph Neural Networks: Implicit Acceleration by Skip Connections and More Depthcited by 55
- 2018Gradient descent with identity initialization efficiently learns positive definite linear transformations by deep residual networkscited by 44
- 2021On the Theory of Implicit Deep Learning: Global Convergence with Implicit Layerscited by 35
- 2017Theory of Deep Learning III: explaining the non-overfitting puzzlecited by 32
4 more
Built on by
Citing papers per year: 2021: 1; 2022: 5; 2023: 4; 2024: 0; 2025: 0; 2026: 1.
11 papers.
- 2021An Unconstrained Layer-Peeled Perspective on Neural Collapsecited by 87
- 2022Augmented Physics-Informed Neural Networks (APINNs): A gating network-based soft domain decomposition methodologycited by 44
- 2023Understanding Multimodal Contrastive Learning and Incorporating Unpaired Datacited by 43
- 2022Freeze then Train: Towards Provable Representation Learning under Spurious Correlations and Feature Noisecited by 22
- 2023HappyMap: A Generalized Multi-calibration Methodcited by 18
- 2023Last-Layer Fairness Fine-tuning is Simple and Effective for Neural Networkscited by 17
- 2022FIFA: Making Fairness More Generalizable in Classifiers Trained on Imbalanced Datacited by 13
- 2022Reinforcement Learning with Stepwise Fairness Constraintscited by 9
- 2022Scalable Set Encoding with Universal Mini-Batch Consistency and Unbiased Full Set Gradient Approximationcited by 4
- 2023Learning Unorthogonalized Matrices for Rotation Estimationcited by 3
- 2026Kernel Reboot: Breaking the Boundaries of Neural Tangent Kernels for Neural Fieldscited by 0
- 2026Kernel Reboot: Breaking the Boundaries of Neural Tangent Kernels for Neural Fields2 Sep 2026
- 2023Learning Unorthogonalized Matrices for Rotation Estimation1 Dec 2023
- 2023Last-Layer Fairness Fine-tuning is Simple and Effective for Neural Networks8 Apr 2023
- 2023HappyMap: A Generalized Multi-calibration Method8 Mar 2023
- 2023Understanding Multimodal Contrastive Learning and Incorporating Unpaired Data13 Feb 2023
- 2022Augmented Physics-Informed Neural Networks (APINNs): A gating network-based soft domain decomposition methodology16 Nov 2022
- 2022Reinforcement Learning with Stepwise Fairness Constraints8 Nov 2022
- 2022Freeze then Train: Towards Provable Representation Learning under Spurious Correlations and Feature Noise20 Oct 2022
- 2022Scalable Set Encoding with Universal Mini-Batch Consistency and Unbiased Full Set Gradient Approximation26 Aug 2022
- 2022FIFA: Making Fairness More Generalizable in Classifiers Trained on Imbalanced Data6 Jun 2022
- 2021An Unconstrained Layer-Peeled Perspective on Neural Collapse6 Oct 2021