mlsanityData to 7 Oct 2026

Approximating Continuous Functions by ReLU Nets of Minimal Width

arXiv 1710.11278 ↗First posted 31 Oct 2017stat.ML cs.CC cs.LGcited by 120

Not on the map. Why?

Abstract (arXiv)

This article concerns the expressive power of depth in deep feed-forward neural nets with ReLU activations. Specifically, we answer the following question: for a fixed din≥ 1, what is the minimal width w so that neural nets with ReLU activations, input dimension din, hidden layer widths at most w, and arbitrary depth can approximate any continuous, real-valued function of din variables arbitrarily well? It turns out that this minimal width is exactly equal to din+1. That is, if all the hidden layer widths are bounded by din, then even in the infinite depth limit, ReLU nets can only express a very limited class of functions, and, on the other hand, any continuous function on the din-dimensional unit cube can be approximated to arbitrary precision by ReLU nets in which all hidden layers have width exactly din+1. Our construction in fact shows that any continuous function f:[0,1]^din→mathbb R^dout can be approximated by a net of width din+dout. We obtain quantitative depth estimates for such an approximation in terms of the modulus of continuity of f.

Key facts. Cited by 120 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Oct 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 18; 2022: 18; 2023: 19; 2024: 25; 2025: 23; 2026: 17.

120 papers.

Sort:

By area:

  1. 2022Pure Transformers are Powerful Graph Learnerscited by 188
  2. 2022N-HiTS: Neural Hierarchical Interpolation for Time Series Forecastingcited by 146
  3. 2021Model Complexity of Deep Learning: A Surveycited by 64
  4. 2021Towards Lower Bounds on the Depth of ReLU Neural Networkscited by 55
  5. 2022Your Transformer May Not be as Powerful as You Expectcited by 55
  6. 2024Transformers are Universal In-context Learnerscited by 42
  7. 2023When Deep Learning Meets Polyhedral Theory: A Surveycited by 39
  8. 2023Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopescited by 36
  9. 2021Transformers Generalize DeepSets and Can be Extended to Graphs and Hypergraphscited by 35
  10. 2024HardNet: Hard-Constrained Neural Networks with Universal Approximation Guaranteescited by 29
  11. 2021Machine-Learning Mathematical Structurescited by 25
  12. 2022Achieve the Minimum Width of Neural Networks for Universal Approximationcited by 25
38 more
  1. 2023HyperDeepONet: learning operator with complex target function space using the limited resources via hypernetworkcited by 25
  2. 2021A Discontinuity Capturing Shallow Neural Network for Elliptic Interface Problemscited by 20
  3. 2023Recent Developments in Machine Learning Methods for Stochastic Control and Gamescited by 19
  4. 2023Minimum width for universal approximation using ReLU networks on compact domaincited by 17
  5. 2022Training Fully Connected Neural Networks is existsℝ-Completecited by 15
  6. 2024Activation degree thresholds and expressiveness of polynomial neural networkscited by 14
  7. 2023Minimum Width of Leaky-ReLU Neural Networks for Uniform Universal Approximationcited by 13
  8. 2024On the optimal approximation of Sobolev and Besov functions using deep ReLU neural networkscited by 13
  9. 2021Arbitrary-Depth Universal Approximation Theorems for Operator Neural Networkscited by 12
  10. 2022Minimal Width for Universal Property of Deep RNNcited by 12
  11. 2021ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computationcited by 11
  12. 2022Neural Tangent Kernel Analysis of Deep Narrow Neural Networkscited by 11
  13. 2021Quantifying Epistemic Uncertainty in Deep Learningcited by 10
  14. 2022Width is Less Important than Depth in ReLU Neural Networkscited by 10
  15. 2023Efficient Uncertainty Quantification and Reduction for Over-Parameterized Neural Networkscited by 10
  16. 2024Optimization Over Trained Neural Networks: Taking a Relaxing Walkcited by 10
  17. 2024PNeRV: Enhancing Spatial Consistency via Pyramidal Neural Representation for Videoscited by 10
  18. 2022Lower and Upper Bounds for Numbers of Linear Regions of Graph Convolutional Networkscited by 9
  19. 2024Addressing common misinterpretations of KART and UAT in neural network literaturecited by 9
  20. 2022Positive-Unlabeled Learning using Random Forests via Recursive Greedy Risk Minimizationcited by 8
  21. 2023Getting Away with More Network Pruning: From Sparsity to Geometry and Linear Regionscited by 8
  22. 2021Meta Internal Learningcited by 7
  23. 2023Norm-based Generalization Bounds for Compositionally Sparse Neural Networkscited by 7
  24. 2023Improved weight initialization for deep and narrow feedforward neural networkcited by 7
  25. 2025Approximation theory for 1-Lipschitz ResNetscited by 7
  26. 2025FSL-SAGE: Accelerating Federated Split Learning via Smashed Activation Gradient Estimationcited by 7
  27. 2021A Shallow Ritz Method for Elliptic Problems with Singular Sourcescited by 6
  28. 2021Ensuring DNN Solution Feasibility for Optimization Problems with Convex Constraints and Its Application to DC Optimal Power Flow Problemscited by 6
  29. 2022Control of Dual-Sourcing Inventory Systems using Recurrent Neural Networkscited by 6
  30. 2023Better NTK Conditioning: A Free Lunch from (ReLU) Nonlinear Activation in Wide Neural Networkscited by 6
  31. 2023Computational Tradeoffs of Optimization-Based Bound Tightening in ReLU Networkscited by 6
  32. 2021Topological Deep Learning: Classification Neural Networkscited by 5
  33. 2021COLD: Concurrent Loads Disaggregator for Non-Intrusive Load Monitoringcited by 5
  34. 2024On the Impacts of the Random Initialization in the Neural Tangent Kernel Theorycited by 5
  35. 2026A Machine Learning Approach to the Nirenberg Problemcited by 5
  36. 2022Vanilla Feedforward Neural Networks as a Discretization of Dynamical Systemscited by 4
  37. 2023Approximation and interpolation of deep neural networkscited by 4
  38. 2023Deep Convolutional Neural Networks with Zero-Padding: Feature Extraction and Learningcited by 4

50 most cited of 120 All 120 (JSON)