DocumentCode
1816608
Title
Function approximation using a partition of the input space
Author
Koiran, Pascal
Author_Institution
Lab. de l´´inf. du parallelisme, Ecole Normale Superiuere de Lyon, France
Volume
1
fYear
1992
fDate
7-11 Jun 1992
Firstpage
883
Abstract
Feedforward neural networks can uniformly approximate continuous functions. It is shown that a simple geometric proof of this theorem, proposed originally for networks of Heaviside units, can be extended to networks of units using a smooth output function. In order to do this, a recent result on the approximation of polynomials by fixed size networks is improved
Keywords
feedforward neural nets; learning (artificial intelligence); polynomials; Heaviside units; approximation of polynomials; continuous functions; fixed size networks; geometric proof; input space partition, feedforward neural nets, function approximation; smooth output function; Computer networks; Equations; Feedforward neural networks; Fourier transforms; Function approximation; Neural networks; Nonhomogeneous media; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1992. IJCNN., International Joint Conference on
Conference_Location
Baltimore, MD
Print_ISBN
0-7803-0559-0
Type
conf
DOI
10.1109/IJCNN.1992.287075
Filename
287075
Link To Document