mlsanityData to 7 Oct 2026

On the Benefits of Over-parameterization for Out-of-Distribution Generalization

arXiv 2403.17592 ↗First posted 26 Mar 2024cs.LG stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

In recent years, machine learning models have achieved success based on the independently and identically distributed assumption. However, this assumption can be easily violated in real-world applications, leading to the Out-of-Distribution (OOD) problem. Understanding how modern over-parameterized DNNs behave under non-trivial natural distributional shifts is essential, as current theoretical understanding is insufficient. Existing theoretical works often provide meaningless results for over-parameterized models in OOD scenarios or even contradict empirical findings. To this end, we are investigating the performance of the over-parameterized model in terms of OOD generalization under the general benign overfitting conditions. Our analysis focuses on a random feature model and examines non-trivial natural distributional shifts, where the benign overfitting estimators demonstrate a constant excess OOD loss, despite achieving zero excess in-distribution (ID) loss. We demonstrate that in this scenario, further increasing the model's parameterization can significantly reduce the OOD loss. Intuitively, the variance term of ID loss remains low due to orthogonality of long-tail features, meaning overfitting noise during training generally doesn't raise testing loss. However, in OOD cases, distributional shift increases the variance term. Thankfully, the inherent shift is unrelated to individual x, maintaining the orthogonality of long-tail features. Expanding the hidden dimension can additionally improve this orthogonality by mapping the features into higher-dimensional spaces, thereby reducing the variance term. We further show that model ensembles also improve OOD loss, akin to increasing model capacity. These insights explain the empirical phenomenon of enhanced OOD generalization through model ensembles, supported by consistent simulations with theoretical results.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 64 of its 102 references that are in the map. First posted on arXiv 26 Mar 2024.

Builds on

64 of 102 references.

References · 64

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  5. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  6. 2019Invariant Risk Minimizationcited by 1,832
  7. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
  8. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  9. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
  10. 2020In Search of Lost Domain Generalizationcited by 1,042
  11. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  12. 2021Robust fine-tuning of zero-shot modelscited by 785
38 more
  1. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
  2. 2017Exploring Generalization in Deep Learningcited by 595
  3. 2019Benign Overfitting in Linear Regressioncited by 544
  4. 2015Causal inference using invariant prediction: identification and confidence intervalscited by 533
  5. 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 431
  6. 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
  7. 2019A Survey of Autonomous Driving: Common Practices and Emerging Technologiescited by 373
  8. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
  9. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 334
  10. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 333
  11. 2017Implicit Regularization in Matrix Factorizationcited by 318
  12. 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
  13. 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 292
  14. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  15. 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 259
  16. 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 248
  17. 2019Two models of double descent for weak featurescited by 194
  18. 2018Just Interpolate: Kernel "Ridgeless" Regression Can Generalizecited by 190
  19. 2020Invariant Risk Minimization Gamescited by 188
  20. 2018To understand deep learning we need to understand kernel learningcited by 186
  21. 2018Gradient descent aligns the layers of deep linear networkscited by 182
  22. 2020Large-Scale Methods for Distributionally Robust Optimizationcited by 179
  23. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 169
  24. 2019Causal Discovery from Heterogeneous/Nonstationary Data with Independent Changescited by 166
  25. 2020Benign overfitting in ridge regressioncited by 152
  26. 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
  27. 2021Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalizationcited by 144
  28. 2019Harmless interpolation of noisy data in regressioncited by 121
  29. 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 117
  30. 2020Classification vs regression in overparameterized regimes: Does the loss function matter?cited by 97
  31. 2022Benign Overfitting in Two-layer Convolutional Neural Networkscited by 90
  32. 2020Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regimecited by 81
  33. 2019Distributionally Robust Optimization and Generalization in Kernel Methodscited by 73
  34. 2021Benign Overfitting of Constant-Stepsize SGD for Linear Regressioncited by 71
  35. 2015Explaining the Success of AdaBoost and Random Forests as Interpolating Classifierscited by 45
  36. 2020An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectivescited by 42
  37. 2021Benign Overfitting in Multiclass Classification: All Roads Lead to Interpolationcited by 41
  38. 2022The Implicit Bias of Benign Overfittingcited by 38

50 most cited of 64 All 64 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 5; 2025: 1; 2026: 1.

7 papers.