How does promoting the minority fraction affect generalization? A theoretical study of the one-hidden-layer neural network on group imbalance
Not on the map. Why?
Abstract (arXiv)
Group imbalance has been a known problem in empirical risk minimization (ERM), where the achieved high average accuracy is accompanied by low accuracy in a minority group. Despite algorithmic efforts to improve the minority group accuracy, a theoretical generalization analysis of ERM on individual groups remains elusive. By formulating the group imbalance problem with the Gaussian Mixture Model, this paper quantifies the impact of individual groups on the sample complexity, the convergence rate, and the average and group-level testing performance. Although our theoretical framework is centered on binary classification using a one-hidden-layer neural network, to the best of our knowledge, we provide the first theoretical analysis of the group-level generalization of ERM in addition to the commonly studied average generalization performance. Sample insights of our theoretical results include that when all group-level co-variance is in the medium regime and all mean are close to zero, the learning performance is most desirable in the sense of a small sample complexity, a fast training rate, and a high average and group-level testing accuracy. Moreover, we show that increasing the fraction of the minority group in the training data does not necessarily improve the generalization performance of the minority group. Our theoretical results are validated on both synthetic and empirical datasets, such as CelebA and CIFAR-10 in image classification.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 59 of its 96 references that are in the map. First posted on arXiv 12 Mar 2024.
Builds on
59 of 96 references.
References · 59
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2019Right for the Wrong Reasons: Diagnosing Syntactic Heuristics in Natural Language Inferencecited by 876
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2017A systematic study of the class imbalance problem in convolutional neural networkscited by 513
- 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
- 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
- 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
38 more
- 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 297
- 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 261
- 2018What is the Effect of Importance Weighting in Deep Learning?cited by 251
- 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 222
- 2022Improving Out-of-Distribution Robustness via Selective Augmentationcited by 202
- 2021Exploring Deep Neural Networks via Layer-Peeled Model: Minority Collapse in Imbalanced Trainingcited by 166
- 2018Counterfactual Fairness in Text Classification through Robustnesscited by 151
- 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
- 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
- 2020Feature Space Augmentation for Long-Tailed Datacited by 136
- 2020M2m: Imbalanced Classification via Major-to-minor Translationcited by 134
- 2020Feature Purification: How Adversarial Training Performs Robust Deep Learningcited by 107
- 2017Spurious Local Minima are Common in Two-Layer ReLU Neural Networkscited by 104
- 2021The Majority Can Help The Minority: Context-rich Minority Oversampling for Long-tailed Classificationcited by 100
- 2021MetaSAug: Meta Semantic Augmentation for Long-Tailed Visual Recognitioncited by 99
- 2017Recovery Guarantees for One-hidden-layer Neural Networkscited by 94
- 2017Shift: A Zero FLOP, Zero Parameter Alternative to Spatial Convolutionscited by 93
- 2016The Landscape of Empirical Risk for Non-convex Lossescited by 86
- 2017Learning Spatial Regularization with Image-level Supervisions for Multi-label Image Classificationcited by 85
- 2017Learning One-hidden-layer Neural Networks with Landscape Designcited by 81
- 2023A Theoretical Understanding of Shallow Vision Transformers: Learning, Generalization, and Sample Complexitycited by 77
- 2022A Survey on Long-Tailed Visual Recognitioncited by 75
- 2019Generative Adversarial Minority Oversamplingcited by 73
- 2021Subgroup Generalization and Fairness of Graph Neural Networkscited by 69
- 2020Dynamical mean-field theory for stochastic gradient descent in Gaussian mixture classificationcited by 60
- 2018Deep Imbalanced Attribute Classification using Visual Attention Aggregationcited by 56
- 2018Learning One-hidden-layer ReLU Networks via Gradient Descentcited by 50
- 2022A Theoretical Analysis on Feature Learning in Neural Networks: Emergence from Inputs and Advantage over Fixed Featurescited by 49
- 2017Gradient Descent Learns One-hidden-layer CNN: Don't be Afraid of Spurious Local Minimacited by 40
- 2023Robust Learning with Progressive Data Expansion Against Spurious Correlationcited by 39
- 2018Singularity, Misspecification, and the Convergence Rate of EMcited by 38
- 2023Understanding and Improving Feature Learning for Out-of-Distribution Generalizationcited by 35
- 2019On the Discrepancy between the Theoretical Analysis and Practical Implementations of Compressed Communication for Distributed Deep Learningcited by 32
- 2017On Learning Mixtures of Well-Separated Gaussianscited by 30
- 2020Fast Learning of Graph Neural Networks with Guaranteed Generalizability: One-hidden-layer Casecited by 24
- 2019Sharp Analysis of Expectation-Maximization for Weakly Identifiable Modelscited by 23
- 2020Data-Dependence of Plateau Phenomenon in Learning with Neural Network --- Statistical Mechanical Analysiscited by 23
- 2022Generalization Guarantee of Training Graph Convolutional Networks with Graph Topology Samplingcited by 23
50 most cited of 59 All 59 (JSON)
Built on by
Citing papers per year: 2024: 3; 2025: 3.
6 papers.
- 2024A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Expertscited by 21
- 2024What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encodingcited by 14
- 2024Learning on Transformers is Provable Low-Rank and Sparse: A One-layer Analysiscited by 8
- 2025How Can Mamba Learn In Context with Outliers and Generalize Provably?cited by 2
- 2025FairNet: Dynamic Fairness Correction without Performance Loss via Contrastive Conditional LoRAcited by 1
- 2025Theoretical Learning Performance of Graph Neural Networks: The Impact of Jumping Connections and Layer-wise Sparsificationcited by 0
- 2025FairNet: Dynamic Fairness Correction without Performance Loss via Contrastive Conditional LoRA22 Oct 2025
- 2025How Can Mamba Learn In Context with Outliers and Generalize Provably?1 Oct 2025
- 2025Theoretical Learning Performance of Graph Neural Networks: The Impact of Jumping Connections and Layer-wise Sparsification7 Jul 2025
- 2024Learning on Transformers is Provable Low-Rank and Sparse: A One-layer Analysis24 Jun 2024
- 2024What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encoding4 Jun 2024
- 2024A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Experts26 May 2024