A Function Space View of Bounded Norm Infinite Width ReLU Nets: The Multivariate Case
Greg Ongie, Rebecca Willett, Daniel Soudry, Nathan Srebro
Abstract
A key element of understanding the efficacy of overparameterized neural networks is characterizing how they represent functions as the number of weights in the network approaches infinity. In this paper, we characterize the norm required to realize a function as a single hidden-layer ReLU network with an unbounded number of units (infinite width), but where the Euclidean norm of the weights is bounded, including precisely characterizing which functions can be realized with finite norm. This was settled for univariate univariate functions in Savarese et al. (2019), where it was shown that the required norm is determined by the L1-norm of the second derivative of the function. We extend the characterization to multivariate functions (i.e., networks with d input units), relating the required norm to the L1-norm of the Radon transform of a (d+1)/2-power Laplacian of the function. This characterization allows us to show that all functions in Sobolev spaces , , can be represented with bounded norm, to calculate the required norm for several specific functions, and to obtain a depth separation result. These results have important implications for understanding generalization performance and the distinction between neural networks and more traditional kernel 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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e602f10b-9213-40da-97fb-1e7257ba1ddcCited by top-tier papers49
- Learning single-index models with shallow neural networksAlberto Bietti, Joan Bruna, Clayton Sanford, Min Jae SongNeurIPS 2022 · 119 citations
- Implicit Bias in Deep Linear Classification: Initialization Scale vs Training AccuracyEdward Moroshko, Blake E. Woodworth, Suriya Gunasekar, Jason D. Lee et al.NeurIPS 2020 · 98 citations
- Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputsEtienne Boursier, Loucas Pillaud-Vivien, Nicolas FlammarionNeurIPS 2022 · 92 citations
- The Implicit Bias of Minima Stability: A View from Function SpaceRotem Mulayoff, Tomer Michaeli, Daniel SoudryNeurIPS 2021 · 65 citations
- Train simultaneously, generalize better: Stability of gradient-based minimax learnersFarzan Farnia, Asuman E. OzdaglarICML 2021 · 56 citations
Builds on1
Related papers
- Tighter Sparse Approximation Bounds for ReLU Neural NetworksCarles Domingo-Enrich, Youssef MrouehICLR 2022 · 4 citations
- The Implicit Bias of Minima Stability in Multivariate Shallow ReLU NetworksMor Shpigel Nacson, Rotem Mulayoff, Greg Ongie, Tomer Michaeli et al.ICLR 2023 · 3 citations
- How Many Neurons Does it Take to Approximate the Maximum?Itay Safran, Daniel Reichman, Paul ValiantSODA 2024 · 3 citations
- Shallow and Deep Networks are Near-Optimal Approximators of Korobov FunctionsMoïse Blanchard, Mohammed Amine BennounaICLR 2022 · 11 citations
- Approximation and non-parametric estimation of functions over high-dimensional spheres via deep ReLU networksNamjoon Suh, Tian-Yi Zhou, Xiaoming HuoICLR 2023
