Qualitative neural network approximation over R and C: Elementary proofs for analytic and polynomial activation
Not on the map. Why?
Abstract (arXiv)
In this article, we prove approximation theorems in classes of deep and shallow neural networks with analytic activation functions by elementary arguments. We prove for both real and complex networks with non-polynomial activation that the closure of the class of neural networks coincides with the closure of the space of polynomials. The closure can further be characterized by the Stone-Weierstrass theorem (in the real case) and Mergelyan's theorem (in the complex case). In the real case, we further prove approximation results for networks with higher-dimensional harmonic activation and orthogonally projected linear maps. We further show that fully connected and residual networks of large depth with polynomial activation functions can approximate any polynomial under certain width requirements. All proofs are entirely elementary.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 36 of its 85 references that are in the map. First posted on arXiv 25 Mar 2022.
Builds on
36 of 85 references.
References · 36
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,238
- 2016Error bounds for approximations with deep ReLU networkscited by 574
- 2015An Introduction to Convolutional Neural Networkscited by 514
- 2018Hyperbolic Neural Networkscited by 402
- 2019Hyperbolic Graph Convolutional Neural Networkscited by 402
- 2014Breaking the Curse of Dimensionality with Convex Neural Networkscited by 331
- 2016Understanding Deep Neural Networks with Rectified Linear Unitscited by 257
- 2019Hyperbolic Graph Neural Networkscited by 244
- 2017Deep Complex Networkscited by 217
- 2017Deep Potential Molecular Dynamics: a scalable model with the accuracy of quantum mechanicscited by 214
24 more
- 2015The Power of Depth for Feedforward Neural Networkscited by 183
- 2017Optimal approximation of piecewise smooth functions using deep ReLU neural networkscited by 179
- 2018Adaptivity of deep ReLU network for learning in Besov and mixed smooth Besov spaces: optimal rate and curse of dimensionalitycited by 162
- 2021Hyperbolic Deep Neural Networks: A Surveycited by 139
- 2017Universal Function Approximation by Deep Neural Nets with Bounded Width and ReLU Activationscited by 104
- 2019The phase diagram of approximation rates for deep neural networkscited by 88
- 2016Approximation by Combinations of ReLU and Squared ReLU Ridge Functions with ℓ1 and ℓ0 Controlscited by 84
- 2017Maximum Principle Based Algorithms for Deep Learningcited by 78
- 2018A Priori Estimates of the Population Risk for Two-layer Neural Networkscited by 76
- 2019Deep ReLU network approximation of functions on a manifoldcited by 74
- 2014DenseNet: Implementing Efficient ConvNet Descriptor Pyramidscited by 66
- 2016Deep vs. shallow networks : An approximation theory perspectivecited by 63
- 2020Representation formulas and pointwise properties for Barron functionscited by 62
- 2021What Kinds of Functions do Deep Neural Networks Learn? Insights from Variational Spline Theorycited by 60
- 2019Approximation spaces of deep neural networkscited by 51
- 2018Exponential Convergence of the Deep Neural Network Approximation for Analytic Functionscited by 38
- 2018Deep, Skinny Neural Networks are not Universal Approximatorscited by 38
- 2017Better than Real: Complex-valued Neural Nets for MRI Fingerprintingcited by 30
- 2020The universal approximation theorem for complex-valued neural networkscited by 28
- 2020Kolmogorov Width Decay and Poor Approximators in Machine Learning: Shallow Neural Networks, Random Feature Models and Neural Tangent Kernelscited by 19
- 2020DeePKS: a comprehensive data-driven approach towards chemically accurate density functional theorycited by 15
- 2021Neural Network Approximation of Refinable Functionscited by 15
- 2015A mathematical motivation for complex-valued convolutional networkscited by 13
- 2019Approximation Rates for Neural Networks with General Activation Functionscited by 3
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.