DocumentCode
1265099
Title
The unreasonable effectiveness of neural network approximation
Author
Dingankar, Ajit T.
Author_Institution
Intel Corp., Folsom, CA, USA
Volume
44
Issue
11
fYear
1999
fDate
11/1/1999 12:00:00 AM
Firstpage
2043
Lastpage
2044
Abstract
Results concerning the approximation rates of neural networks are of particular interest to engineers. The results reported in the literature have “slow approximation rates” O(1/√m), where m is the number of parameters in the neural network. However, many empirical studies report that neural network approximation is quite effective in practice. We give an explanation of this unreasonable effectiveness by proving the existence of approximation schemes that converge at a rate of the order of 1/m2 by using methods from number theory
Keywords
approximation theory; convergence of numerical methods; neural nets; number theory; approximation rates; convergence; neural network approximation; number theory; rational approximation; Approximation algorithms; Arithmetic; Computational efficiency; Convergence; Function approximation; Neural networks; Signal processing; Signal processing algorithms;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/9.802912
Filename
802912
Link To Document