mlsanityData to 14 Oct 2026

ReLU Neural Networks with Linear Layers are Biased Towards Single- and Multi-Index Models

arXiv 2305.15598 ↗First posted 24 May 2023cs.LG stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

Neural networks often operate in the overparameterized regime, in which there are far more parameters than training samples, allowing the training data to be fit perfectly. That is, training the network effectively learns an interpolating function, and properties of the interpolant affect predictions the network will make on new samples. This manuscript explores how properties of such functions learned by neural networks of depth greater than two layers. Our framework considers a family of networks of varying depths that all have the same capacity but different representation costs. The representation cost of a function induced by a neural network architecture is the minimum sum of squared weights needed for the network to represent the function; it reflects the function space bias associated with the architecture. Our results show that adding additional linear layers to the input side of a shallow ReLU network yields a representation cost favoring functions with low mixed variation -- that is, it has limited variation in directions orthogonal to a low-dimensional subspace and can be well approximated by a single- or multi-index model. This bias occurs because minimizing the sum of squared weights of the linear layers is equivalent to minimizing a low-rank promoting Schatten quasi-norm of a single "virtual" weight matrix. Our experiments confirm this behavior in standard network training regimes. They additionally show that linear layers can improve generalization and the learned network is well-aligned with the true latent low-dimensional linear subspace when data is generated using a multi-index model.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 38 of its 76 references that are in the map. First posted on arXiv 24 May 2023.

Builds on

38 of 76 references.

References · 38

  1. 2013Do Deep Nets Really Need to be Deep?cited by 474
  2. 2019Implicit Regularization in Deep Matrix Factorizationcited by 405
  3. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
  4. 2014Breaking the Curse of Dimensionality with Convex Neural Networkscited by 331
  5. 2017Implicit Regularization in Matrix Factorizationcited by 322
  6. 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 320
  7. 2015Norm-Based Capacity Control in Neural Networkscited by 299
  8. 2018On the Optimization of Deep Networks: Implicit Acceleration by Overparameterizationcited by 284
  9. 2018Gradient descent aligns the layers of deep linear networkscited by 182
  10. 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
  11. 2021The Low-Rank Simplicity Bias in Deep Networkscited by 154
  12. 2020Implicit Regularization in Deep Learning May Not Be Explainable by Normscited by 119
26 more
  1. 2019A Function Space View of Bounded Norm Infinite Width ReLU Nets: The Multivariate Casecited by 114
  2. 2019How do infinite width bounded norm networks look in function space?cited by 106
  3. 2020Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networkscited by 98
  4. 2022Learning Single-Index Models with Shallow Neural Networkscited by 92
  5. 2021Sharp Bounds on the Approximation Rates, Metric Entropy, and n-widths of Shallow Neural Networkscited by 86
  6. 2022Neural Networks Efficiently Learn Low-Dimensional Representations with SGDcited by 63
  7. 2020Representation formulas and pointwise properties for Barron functionscited by 62
  8. 2021What Kinds of Functions do Deep Neural Networks Learn? Insights from Variational Spline Theorycited by 60
  9. 2021Initialization and Regularization of Factorized Neural Layerscited by 58
  10. 2020Revealing the Structure of Deep Neural Networks via Convex Dualitycited by 54
  11. 2019Lexicographic and Depth-Sensitive Margins in Homogeneous and Non-Homogeneous Deep Modelscited by 53
  12. 2021Understanding neural networks with reproducing kernel Banach spacescited by 50
  13. 2021Characterization of the Variation Spaces Corresponding to Shallow Neural Networkscited by 48
  14. 2021Implicit Regularization in Tensor Factorizationcited by 44
  15. 2021Near-Minimax Optimal Estimation With Shallow ReLU Neural Networkscited by 41
  16. 2022Implicit Bias of Large Depth Networks: a Notion of Rank for Nonlinear Functionscited by 38
  17. 2020Are wider nets better given the same number of parameters?cited by 27
  18. 2023Penalising the biases in norm regularisation enforces sparsitycited by 19
  19. 2022Ridges, Neural Networks, and the Radon Transformcited by 18
  20. 2021Path Regularization: A Convexity and Sparsity Inducing Regularization for Parallel ReLU Networkscited by 14
  21. 2023Autoencoders for discovering manifold dimension and coordinates in data from complex dynamical systemscited by 13
  22. 2021Parallel Deep Neural Networks Have Zero Duality Gapcited by 9
  23. 2015Matrix Completion Under Monotonic Single Index Modelscited by 8
  24. 2016On Learning High Dimensional Structured Single Index Modelscited by 6
  25. 2022Intrinsic dimensionality and generalization properties of the R-norm inductive biascited by 5
  26. 2020Learning functions varying along a central subspacecited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 3; 2025: 1; 2026: 2.

8 papers.