An integral upper bound for neural network approximation
Related Experiment Videos
1Department of Mathematics, Georgetown University, Washington, DC 20057-1233, USA. kainen@georgetown.edu
Abstract:
Complexity of one-hidden-layer networks is studied using tools from nonlinear approximation and integration theory. For functions with suitable integral representations in the form of networks with infinitely many hidden units, upper bounds are derived on the speed of decrease of approximation error as the number of network units increases. These bounds are obtained for various norms using the framework of Bochner integration. Results are applied to perceptron networks.
Related Concept Videos
Approximate Integration
Application of Linearization and Approximation
Linear Approximations
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...
Improper Integrals: Infinite Intervals
Linearization and Approximation