mlsanityData to 7 Oct 2026

Tighter Sparse Approximation Bounds for ReLU Neural Networks

arXiv 2110.03673 ↗First posted 7 Oct 2021stat.ML cs.LG math.STcited by 3

Not on the map. Why?

Abstract (arXiv)

A well-known line of work (Barron, 1993; Breiman, 1993; Klusowski & Barron, 2018) provides bounds on the width n of a ReLU two-layer neural network needed to approximate a function f over the ball BR(ℝd) up to error ε, when the Fourier based quantity Cf = frac1(2π)d/2 intℝd |xi|2 |hatf(xi)| dxi is finite. More recently Ongie et al. (2019) used the Radon transform as a tool for analysis of infinite-width ReLU two-layer networks. In particular, they introduce the concept of Radon-based R-norms and show that a function defined on ℝd can be represented as an infinite-width two-layer neural network if and only if its R-norm is finite. In this work, we extend the framework of Ongie et al. (2019) and define similar Radon-based semi-norms (R, U-norms) such that a function admits an infinite-width neural network representation on a bounded open set U subseteq ℝd when its R, U-norm is finite. Building on this, we derive sparse (finite-width) neural network approximation bounds that refine those of Breiman (1993); Klusowski & Barron (2018). Finally, we show that infinite-width neural network representations on bounded open sets are not unique and study their structure, providing a functional view of mode connectivity.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 17 of its 34 references that are in the map. First posted on arXiv 7 Oct 2021.

Builds on

17 of 34 references.

References · 17

  1. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
  2. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  3. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
  4. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  5. 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
  6. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
  7. 2014Breaking the Curse of Dimensionality with Convex Neural Networkscited by 329
  8. 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
  9. 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
  10. 2018Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernelcited by 131
  11. 2019A Function Space View of Bounded Norm Infinite Width ReLU Nets: The Multivariate Casecited by 113
  12. 2019How do infinite width bounded norm networks look in function space?cited by 105
5 more
  1. 2016Approximation by Combinations of ReLU and Squared ReLU Ridge Functions with ℓ1 and ℓ0 Controlscited by 84
  2. 2019Explaining Landscape Connectivity of Low-cost Solutions for Multilayer Netscited by 63
  3. 2020Representation formulas and pointwise properties for Barron functionscited by 62
  4. 2021What Kinds of Functions do Deep Neural Networks Learn? Insights from Variational Spline Theorycited by 60
  5. 2021Understanding neural networks with reproducing kernel Banach spacescited by 50

Built on by

Cited by year

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

3 papers.