Tilting the Odds at the Lottery: the Interplay of Overparameterisation and Curricula in Neural Networks
Stefano Sarao Mannelli, Yaraslau Ivashinka, Andrew M. Saxe, Luca Saglietti
Abstract
A wide range of empirical and theoretical works have shown that overparameterisation can amplify the performance of neural networks. According to the lottery ticket hypothesis, overparameterised networks have an increased chance of containing a sub-network that is well-initialised to solve the task at hand. A more parsimonious approach, inspired by animal learning, consists in guiding the learner towards solving the task by curating the order of the examples, i.e. providing a curriculum. However, this learning strategy seems to be hardly beneficial in deep learning applications. In this work, we undertake an analytical study that connects curriculum learning and overparameterisation. In particular, we investigate their interplay in the online learning setting for a 2-layer network in the XOR-like Gaussian Mixture problem. Our results show that a high degree of overparameterisation—while simplifying the problem—can limit the benefit from curricula, providing a theoretical account of the ineffectiveness of curricula in deep learning.
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.
Cited by top-tier papers5
- Influence Dynamics and Stagewise Data AttributionJin Hwa Lee, Matthew Smith, Maxwell Adam, Jesse HooglandICLR 2026 · 5 citations
- Positive Distribution Shift as a Framework for Understanding Tractable LearningMarko Medvedev, Idan Attias, Elisabetta Cornacchia, Theodor Misiakiewicz et al.ICML 2026 · 3 citations
- Provable Sample Efficiency of Curriculum Post-Training for Transformer ReasoningDake Bu, Wei Huang, Andi Han, Atsushi Nitanda et al.ICML 2026
- Optimal Protocols for Continual Learning via Statistical Physics and Control TheoryFrancesco Mori, Stefano Sarao Mannelli, Francesca MignaccoICLR 2025
- Adaptive Data Optimization: Dynamic Sample Selection with Scaling LawsYiding Jiang, Allan Zhou, Zhili Feng, Sadhika Malladi et al.ICLR 2025
Builds on12
- Beyond neural scaling laws: beating power law scaling via data pruningBen Sorscher, Robert Geirhos, Shashank Shekhar, Surya Ganguli et al.NeurIPS 2022 · 720 citations
- Learning curves of generic features maps for realistic datasets with a teacher-student modelBruno Loureiro, Cédric Gerbelot, Hugo Cui, Sebastian Goldt et al.NeurIPS 2021 · 170 citations
- When Do Curricula Work?Xiaoxia Wu, Ethan Dyer, Behnam NeyshaburICLR 2021 · 141 citations
- High-dimensional limit theorems for SGD: Effective dynamics and critical scalingGérard Ben Arous, Reza Gheissari, Aukosh JagannathNeurIPS 2022 · 94 citations
- Classifying high-dimensional Gaussian mixtures: Where kernel methods fail and neural networks succeedMaria Refinetti, Sebastian Goldt, Florent Krzakala, Lenka ZdeborováICML 2021 · 83 citations
Related papers
- Logarithmic Pruning is All You NeedLaurent Orseau, Marcus Hutter, Omar RivasplataNeurIPS 2020 · 102 citations
- Benign Overfitting in Two-Layer ReLU Convolutional Neural Networks for XOR DataXuran Meng, Difan Zou, Yuan CaoICML 2024 · 11 citations
- Optimal Lottery Tickets via Subset Sum: Logarithmic Over-Parameterization is SufficientAnkit Pensia, Shashank Rajput, Alliot Nagle, Harit Vishwakarma et al.NeurIPS 2020 · 115 citations
- Provable Advantage of Curriculum Learning on Parity Targets with Mixed InputsEmmanuel Abbe, Elisabetta Cornacchia, Aryo LotfiNeurIPS 2023 · 29 citations
- Proving the Lottery Ticket Hypothesis for Convolutional Neural NetworksArthur da Cunha, Emanuele Natale, Laurent ViennotICLR 2022 · 31 citations
