Noncompact uniform universal approximation
Teun D. H. van Nuland

TL;DR
This paper extends the universal approximation theorem to noncompact spaces, characterizing which functions neural networks can uniformly approximate based on activation function properties, revealing algebraic structures and independence from network depth.
Contribution
It generalizes the universal approximation theorem to noncompact input spaces and characterizes the approximation capabilities based on activation function limits and boundedness.
Findings
Neural networks with one hidden layer can approximate all functions vanishing at infinity.
The space of approximable functions forms an algebra under pointwise multiplication for networks with ≥2 layers.
The algebra of approximable functions is independent of the number of layers when the activation function is bounded and continuous.
Abstract
The universal approximation theorem is generalised to uniform convergence on the (noncompact) input space . All continuous functions that vanish at infinity can be uniformly approximated by neural networks with one hidden layer, for all activation functions that are continuous, nonpolynomial, and asymptotically polynomial at . When is moreover bounded, we exactly determine which functions can be uniformly approximated by neural networks, with the following unexpected results. Let denote the vector space of functions that are uniformly approximable by neural networks with hidden layers and inputs. For all and all , turns out to be an algebra under the pointwise product. If the left limit of differs from its right…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum many-body systems · Matrix Theory and Algorithms
