How Does Overparameterization Affect Features?
Not on the map. Why?
Abstract (arXiv)
Overparameterization, the condition where models have more parameters than necessary to fit their training loss, is a crucial factor for the success of deep learning. However, the characteristics of the features learned by overparameterized networks are not well understood. In this work, we explore this question by comparing models with the same architecture but different widths. We first examine the expressivity of the features of these models, and show that the feature space of overparameterized networks cannot be spanned by concatenating many underparameterized features, and vice versa. This reveals that both overparameterized and underparameterized networks acquire some distinctive features. We then evaluate the performance of these models, and find that overparameterized networks outperform underparameterized networks, even when many of the latter are concatenated. We corroborate these findings using a VGG-16 and ResNet18 on CIFAR-10 and a Transformer on the MNLI classification dataset. Finally, we propose a toy setting to explain how overparameterized networks can learn some important features that the underparamaterized networks cannot learn.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 26 references that are in the map. First posted on arXiv 1 Jul 2024.
Builds on
21 of 26 references.
References · 21
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,829
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2016Wide Residual Networkscited by 3,057
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,160
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2021Do Vision Transformers See Like Convolutional Neural Networks?cited by 671
9 more
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
- 2018Insights on representational similarity in neural networks with canonical correlationcited by 318
- 2020Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and Depthcited by 241
- 2017Approximating Continuous Functions by ReLU Nets of Minimal Widthcited by 120
- 2020What Happens To BERT Embeddings During Fine-tuning?cited by 113
- 2020Why Do Better Loss Functions Lead to Less Transferable Features?cited by 73
- 2022Understanding Robust Learning through the Lens of Representation Similaritiescited by 12
- 2016Supervised and Semi-Supervised Text Categorization using LSTM for Region Embeddingscited by 11
Built on by
Not cited yet.