On decision regions of narrow deep neural networks
Not on the map. Why?
Abstract (arXiv)
We show that for neural network functions that have width less or equal to the input dimension all connected components of decision regions are unbounded. The result holds for continuous and strictly monotonic activation functions as well as for the ReLU activation function. This complements recent results on approximation capabilities by [Hanin 2017 Approximating] and connectivity of decision regions by [Nguyen 2018 Neural] for such narrow neural networks. Our results are illustrated by means of numerical experiments.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Jul 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 1; 2026: 1.
5 papers.
- 2024The Real Tropical Geometry of Neural Networkscited by 23
- 2023Minimum Width of Leaky-ReLU Neural Networks for Uniform Universal Approximationcited by 13
- 2024Defining Neural Network Architecture through Polytope Structures of Datasetcited by 2
- 2025An in-depth look at approximation via deep and narrow neural networkscited by 0
- 2026Empirical Evidence for Simply Connected Decision Regions in Image Classifierscited by 0
- 2026Empirical Evidence for Simply Connected Decision Regions in Image Classifiers7 May 2026
- 2025An in-depth look at approximation via deep and narrow neural networks8 Oct 2025
- 2024The Real Tropical Geometry of Neural Networks18 Mar 2024
- 2024Defining Neural Network Architecture through Polytope Structures of Dataset4 Feb 2024
- 2023Minimum Width of Leaky-ReLU Neural Networks for Uniform Universal Approximation29 May 2023