A single hidden layer feedforward network with only one neuron in the hidden layer can approximate any univariate function
Not on the map. Why?
Abstract (arXiv)
The possibility of approximating a continuous function on a compact subset of the real line by a feedforward single hidden layer neural network with a sigmoidal activation function has been studied in many papers. Such networks can approximate an arbitrary continuous function provided that an unlimited number of neurons in a hidden layer is permitted. In this paper, we consider constructive approximation on any finite interval of ℝ by neural networks with only one neuron in the hidden layer. We construct algorithmically a smooth, sigmoidal, almost monotone activation function σ providing approximation to an arbitrary continuous function within any degree of accuracy. This algorithm is implemented in a computer program, which computes the value of σ at any reasonable point of the real axis.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Dec 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 2; 2025: 0; 2026: 3.
6 papers.
- 2024Addressing common misinterpretations of KART and UAT in neural network literaturecited by 9
- 2021A Unified and Constructive Framework for the Universality of Neural Networkscited by 4
- 2024Learnability of high-dimensional targets by two-parameter models and gradient flowcited by 0
- 2026Universal Approximation Theorem for Input-Connected Multilayer Perceptronscited by 0
- 2026On Explicit Super-Expressive Approximation for Neural Networkscited by 0
- 2026Arbitrary-Accuracy Neural Approximation with Optimal Neuron Count and Near-Optimal Bit Complexitycited by 0
- 2026Arbitrary-Accuracy Neural Approximation with Optimal Neuron Count and Near-Optimal Bit Complexity28 Sep 2026
- 2026On Explicit Super-Expressive Approximation for Neural Networks7 Jul 2026
- 2026Universal Approximation Theorem for Input-Connected Multilayer Perceptrons20 Jan 2026
- 2024Addressing common misinterpretations of KART and UAT in neural network literature29 Aug 2024
- 2024Learnability of high-dimensional targets by two-parameter models and gradient flow26 Feb 2024
- 2021A Unified and Constructive Framework for the Universality of Neural Networks30 Dec 2021