An integral upper bound for neural network approximation.
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.
Kainen
Paul C
PC
Department of Mathematics, Georgetown University, Washington, DC 20057-1233, USA. kainen@georgetown.edu
Kůrková
Vera
V
D000200:Action Potentials / Q000502:physiology; D000465:Algorithms; D001921:Brain / Q000502:physiology; D003198:Computer Simulation; D009415:Nerve Net / Q000502:physiology; D016571:Neural Networks, Computer; D009474:Neurons / Q000502:physiology