The impact of allocation strategies in subset learning on the expressive power of neural networks
Ofir Schlisselberg, Ran Darshan
Abstract
In traditional machine learning, models are defined by a set of parameters, which are optimized to perform specific tasks. In neural networks, these parameters correspond to the synaptic weights. However, in reality, it is often infeasible to control or update all weights. This challenge is not limited to artificial networks but extends to biological networks, such as the brain, where the extent of distributed synaptic weight modification during learning remains unclear. Motivated by these insights, we theoretically investigate how different allocations of a fixed number of learnable weights influence the capacity of neural networks. Using a teacher-student setup, we introduce a benchmark to quantify the expressivity associated with each allocation. We establish conditions under which allocations have 'maximal' or 'minimal' expressive power in linear recurrent neural networks and linear multi-layer feedforward networks. For suboptimal allocations, we propose heuristic principles to estimate their expressivity. These principles extend to shallow ReLU networks as well. Finally, we validate our theoretical findings with empirical experiments. Our results emphasize the critical role of strategically distributing learnable weights across the network, showing that a more widespread allocation generally enhances the network's expressive power.
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 7682fa94-5dd3-4c8d-a3a3-11af6da69922Builds on10
- Supermasks in SuperpositionMitchell Wortsman, Vivek Ramanujan, Rosanne Liu, Aniruddha Kembhavi et al.NeurIPS 2020 · 364 citations
- ADAHESSIAN: An Adaptive Second Order Optimizer for Machine LearningZhewei Yao, Amir Gholami, Sheng Shen, Mustafa Mustafa et al.AAAI 2021 · 358 citations
- Proving the Lottery Ticket Hypothesis: Pruning is All You NeedEran Malach, Gilad Yehudai, Shai Shalev-Shwartz, Ohad ShamirICML 2020 · 327 citations
- Training Neural Networks with Fixed Sparse MasksYi-Lin Sung, Varun Nair, Colin RaffelNeurIPS 2021 · 295 citations
- On the Expressive Power of Geometric Graph Neural NetworksChaitanya K. Joshi, Cristian Bodnar, Simon V. Mathis, Taco Cohen et al.ICML 2023 · 125 citations
Related papers
- A theory of weight distribution-constrained learningWeishun Zhong, Ben Sorscher, Daniel Lee, Haim SompolinskyNeurIPS 2022 · 5 citations
- Structured flexibility in recurrent neural networks via neuromodulationJulia Costacurta, Shaunak Bhandarkar, David M. Zoltowski, Scott W. LindermanNeurIPS 2024 · 21 citations
- The computational and learning benefits of Daleian neural networksAdam Haber, Elad SchneidmanNeurIPS 2022 · 10 citations
- Expressivity of Neural Networks with Random Weights and Learned BiasesEzekiel Williams, Alexandre Payeur, Avery Hee-Woon Ryoo, Thomas Jiralerspong et al.ICLR 2025
- How connectivity structure shapes rich and lazy learning in neural circuitsYuhan Helena Liu, Aristide Baratin, Jonathan Cornford, Stefan Mihalas et al.ICLR 2024 · 26 citations
