Finite Samples for Shallow Neural Networks
Not on the map. Why?
Abstract (arXiv)
This paper investigates the ability of finite samples to identify two-layer irreducible shallow networks with various nonlinear activation functions, including rectified linear units (ReLU) and analytic functions such as the logistic sigmoid and hyperbolic tangent. An ``irreducible" network is one whose function cannot be represented by another network with fewer neurons. For ReLU activation functions, we first establish necessary and sufficient conditions for determining the irreducibility of a network. Subsequently, we prove a negative result: finite samples are insufficient for definitive identification of any irreducible ReLU shallow network. Nevertheless, we demonstrate that for a given irreducible network, one can construct a finite set of sampling points that can distinguish it from other network with the same neuron count. Conversely, for logistic sigmoid and hyperbolic tangent activation functions, we provide a positive result. We construct finite samples that enable the recovery of two-layer irreducible shallow analytic networks. To the best of our knowledge, this is the first study to investigate the exact identification of two-layer irreducible networks using finite sample function values. Our findings provide insights into the comparative performance of networks with different activation functions under limited sampling conditions.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 31 references that are in the map. First posted on arXiv 17 Mar 2025.
Builds on
15 of 31 references.
References · 15
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
- 2020Deep Network Approximation for Smooth Functionscited by 164
- 2017Approximating Continuous Functions by ReLU Nets of Minimal Widthcited by 122
- 2021Sharp Bounds on the Approximation Rates, Metric Entropy, and n-widths of Shallow Neural Networkscited by 86
- 2019Reverse-Engineering Deep ReLU Networkscited by 83
- 2019Deep Learning via Dynamical Systems: An Approximation Perspectivecited by 78
- 2021Parameter identifiability of a deep feedforward ReLU neural networkcited by 24
- 2021An Embedding of ReLU Networks and an Analysis of their Identifiabilitycited by 20
- 2020Affine symmetries and neural network identifiabilitycited by 18
- 2021On minimal representations of shallow ReLU networkscited by 13
- 2023How many Neurons do we need? A refined Analysis for Shallow Networks trained with Gradient Descentcited by 10
- 2021Stable Recovery of Entangled Weights: Towards Robust Identification of Deep Neural Networks from Minimal Samplescited by 8
Built on by
Not cited yet.