Geometric separation and constructive universal approximation with two hidden layers
Not on the map. Why?
Abstract (arXiv)
We give a geometric construction of neural networks that separate disjoint compact subsets of Bbb Rn, and use it to obtain a constructive universal approximation theorem. Specifically, we show that networks with two hidden layers and either a sigmoidal activation (i.e., strictly monotone bounded continuous) or the ReLU activation can approximate any real-valued continuous function on an arbitrary compact set KsubsetBbb Rn to any prescribed accuracy in the uniform norm. For finite K, the construction simplifies and yields a sharp depth-2 (single hidden layer) approximation result.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 16 references that are in the map. First posted on arXiv 12 Feb 2026.
Builds on
5 of 16 references.
References · 5
- 2016Error bounds for approximations with deep ReLU networkscited by 567
- 2018Small ReLU networks are powerful memorizers: a tight analysis of memorization capacitycited by 76
- 2015Neural Network with Unbounded Activation Functions is Universal Approximatorcited by 63
- 2023Minimum width for universal approximation using ReLU networks on compact domaincited by 17
- 2024An elementary proof of a universal approximation theoremcited by 1
Built on by
Not cited yet.