Simplicity Bias of Two-Layer Networks beyond Linearly Separable Data
Nikita Tsoy, Nikola Konstantinov
Abstract
Simplicity bias, the propensity of deep models to over-rely on simple features, has been identified as a potential reason for limited out-ofdistribution generalization of neural networks (Shah et al., 2020) . Despite the important implications, this phenomenon has been theoretically confirmed and characterized only under strong dataset assumptions, such as linear separability (Lyu et al., 2021) . In this work, we characterize simplicity bias for general datasets in the context of two-layer neural networks initialized with small weights and trained with gradient flow. Specifically, we prove that in the early training phases, network features cluster around a few directions that do not depend on the size of the hidden layer. Furthermore, for datasets with an XOR-like pattern, we precisely identify the learned features and demonstrate that simplicity bias intensifies during later training stages. These results indicate that features learned in the middle stages of training may be more useful for OOD transfer. We support this hypothesis with experiments on image data.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 2e317e0f-2741-4e90-8f9a-0b211dc5bf9bCited by top-tier papers7
- Saddle-to-Saddle Dynamics Explains A Simplicity Bias Across Neural Network ArchitecturesYedi Zhang, Andrew M. Saxe, Peter E. LathamICLR 2026 · 15 citations
- Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for TransformersPeter Shaw, James Cohan, Jacob Eisenstein, Kristina ToutanovaICLR 2026 · 7 citations
- Neural Collapse under Gradient Flow on Shallow ReLU Networks for Orthogonally Separable DataHancheng Min, Zhihui Zhu, René VidalNeurIPS 2025 · 3 citations
- Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the WildDamien Teney, Liangze Jiang, Florin Gogianu, Ehsan AbbasnejadCVPR 2025
- Gradient Flow Provably Learns Robust Classifiers for Orthonormal GMMsHancheng Min, René VidalICML 2025
Builds on29
- The Pitfalls of Simplicity Bias in Neural NetworksHarshay Shah, Kaustav Tamuly, Aditi Raghunathan, Prateek Jain et al.NeurIPS 2020 · 503 citations
- Gradient Descent Maximizes the Margin of Homogeneous Neural NetworksKaifeng Lyu, Jian LiICLR 2020 · 402 citations
- A Geometric Analysis of Neural Collapse with Unconstrained FeaturesZhihui Zhu, Tianyu Ding, Jinxin Zhou, Xiao Li et al.NeurIPS 2021 · 303 citations
- Frequency Bias in Neural Networks for Input of Non-Uniform DensityRonen Basri, Meirav Galun, Amnon Geifman, David W. Jacobs et al.ICML 2020 · 229 citations
- Directional convergence and alignment in deep learningZiwei Ji, Matus TelgarskyNeurIPS 2020 · 226 citations
Related papers
- Evading the Simplicity Bias: Training a Diverse Set of Models Discovers Solutions with Superior OOD GeneralizationDamien Teney, Ehsan Abbasnejad, Simon Lucey, Anton van den HengelCVPR 2022 · 32 citations
- Feature Contamination: Neural Networks Learn Uncorrelated Features and Fail to GeneralizeTianren Zhang, Chujie Zhao, Guanyu Chen, Yizhou Jiang et al.ICML 2024 · 12 citations
- Simplicity Bias in 1-Hidden Layer Neural NetworksDepen Morwani, Jatin Batra, Prateek Jain, Praneeth NetrapalliNeurIPS 2023 · 33 citations
- The Double-Edged Sword of Implicit Bias: Generalization vs. Robustness in ReLU NetworksSpencer Frei, Gal Vardi, Peter L. Bartlett, Nati SrebroNeurIPS 2023 · 25 citations
- Feature Reconstruction From Outputs Can Mitigate Simplicity Bias in Neural NetworksSravanti Addepalli, Anshul Nasery, Venkatesh Babu Radhakrishnan, Praneeth Netrapalli et al.ICLR 2023
