mlsanityData to 7 Oct 2026

Solution space and storage capacity of fully connected two-layer neural networks with generic activation functions

arXiv 2404.13404 ↗First posted 20 Apr 2024cond-mat.dis-nn cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

The storage capacity of a binary classification model is the maximum number of random input-output pairs per parameter that the model can learn. It is one of the indicators of the expressive power of machine learning models and is important for comparing the performance of various models. In this study, we analyze the structure of the solution space and the storage capacity of fully connected two-layer neural networks with general activation functions using the replica method from statistical physics. Our results demonstrate that the storage capacity per parameter remains finite even with infinite width and that the weights of the network exhibit negative correlations, leading to a 'division of labor'. In addition, we find that increasing the dataset size triggers a phase transition at a certain transition point where the permutation symmetry of weights is broken, resulting in the solution space splitting into disjoint regions. We identify the dependence of this transition point and the storage capacity on the choice of activation function. These findings contribute to understanding the influence of activation functions and the number of parameters on the structure of the solution space, potentially offering insights for selecting appropriate architectures based on specific objectives.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 46 references that are in the map. First posted on arXiv 20 Apr 2024.

Builds on

21 of 46 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  4. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
  5. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
  6. 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 304
  7. 2014The Loss Surfaces of Multilayer Networkscited by 278
  8. 2015Statistical physics of inference: Thresholds and algorithmscited by 128
  9. 2017Spurious Local Minima are Common in Two-Layer ReLU Neural Networkscited by 104
  10. 2016Topology and Geometry of Half-Rectified Network Optimizationcited by 102
  11. 2019Scaling description of generalization with number of parameters in deep learningcited by 83
  12. 2018The jamming transition as a paradigm to understand the loss landscape of deep neural networkscited by 61
9 more
  1. 2018The committee machine: Computational to statistical gaps in learning a two-layers neural networkcited by 58
  2. 2019Properties of the geometry of solutions and capacity of multi-layer neural networks with Rectified Linear Units activationscited by 22
  3. 2019Hidden Unit Specialization in Layered Neural Networks: ReLU vs. Sigmoidal Activationcited by 14
  4. 2020Activation function dependence of the storage capacity of treelike neural networkscited by 10
  5. 2024Exact capacity of the wide hidden layer treelike neural networks with generic activationscited by 6
  6. 2024Fixed width treelike neural networks capacity analysis -- generic activationscited by 4
  7. 2023Capacity of the treelike sign perceptrons neural networks with one hidden layer -- RDT based upper boundscited by 3
  8. 2023Lifted RDT based capacity analysis of the 1-hidden layer treelike sign perceptrons neural networkscited by 3
  9. 2019From complex to simple : hierarchical free-energy landscape renormalized in deep neural networkscited by 2

Built on by

Cited by year (2026 to 7 Oct)

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

3 papers.