Related Experiment Video
Updated: Mar 2, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
Published on: March 1, 2022
Probabilistic lower bounds for approximation by shallow perceptron networks
Věra Kůrková1, Marcello Sanguineti2
1Institute of Computer Science, Czech Academy of Sciences, Pod Vodárenskou věží, 2 - 18207 Prague, Czech Republic.
Shallow perceptron networks struggle to approximate many functions. Achieving good approximation requires a large number of network units, exceeding polynomial bounds relative to the domain size.
Area of Science:
- Computer Science
- Machine Learning
- Artificial Intelligence
Background:
- Shallow perceptron networks are fundamental neural network architectures.
- Understanding their approximation capabilities is crucial for designing efficient AI models.
- Previous research has explored limitations, but precise bounds for general functions remain an active area.
Purpose of the Study:
- To investigate the approximation limitations of shallow perceptron networks.
- To derive lower bounds on approximation errors for binary-valued functions.
- To determine the necessary network size for effective function approximation.
Main Methods:
- Derivation of lower bounds on approximation errors.
- Application of probabilistic Chernoff-Hoeffding bounds.
- Estimation of function set sizes computable by shallow networks.
Main Results:
- A significant lower bound on approximation error is established for shallow networks.
- It is proven that a large number of network units is required for good approximation.
- This requirement scales beyond polynomial in the logarithm of the domain size for random functions.
Conclusions:
- Shallow perceptron networks have inherent limitations in approximating arbitrary functions.
- Effective approximation necessitates a substantial increase in network complexity.
- The findings provide theoretical insights into the capacity of shallow neural networks.
Related Concept Videos
Application of Linearization and Approximation
Linearization and Approximation
Accuracy, limits, and approximation
Accuracy is defined as the closeness of the measured value to the true or actual value. In engineering mechanics, repeated measurements are taken during theoretical or experimental analyses to ensure that the result is precise and accurate.
The accuracy of any solution is based on the...
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
Propagation of Uncertainty from Random Error