mlsanityData to 7 Oct 2026

The impact of allocation strategies in subset learning on the expressive power of neural networks

arXiv 2502.06300 ↗First posted 10 Feb 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 52 references that are in the map. First posted on arXiv 10 Feb 2025.

Builds on

22 of 52 references.

References · 22

  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  2. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
  3. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  4. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 860
  5. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
  6. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
  7. 2014On the Number of Linear Regions of Deep Neural Networkscited by 378
  8. 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
  9. 2016On the Expressive Power of Deep Neural Networkscited by 302
  10. 2020Supermasks in Superpositioncited by 223
  11. 2021Training Neural Networks with Fixed Sparse Maskscited by 212
  12. 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 201
10 more
  1. 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
  2. 2018Adversarial Reprogramming of Neural Networkscited by 115
  3. 2023The Expressive Power of Low-Rank Adaptationcited by 100
  4. 2015On the Expressive Power of Deep Learning: A Tensor Analysiscited by 97
  5. 2023On the Expressive Power of Geometric Graph Neural Networkscited by 89
  6. 2017Expressive power of recurrent neural networkscited by 30
  7. 2021An Analytical Theory of Curriculum Learning in Teacher-Student Networkscited by 27
  8. 2016Capacity and Trainability in Recurrent Neural Networkscited by 26
  9. 2023SPDF: Sparse Pre-training and Dense Fine-tuning for Large Language Modelscited by 26
  10. 2023The Expressive Power of Tuning Only the Normalization Layerscited by 13

Built on by

Not cited yet.