DocumentCode
2622866
Title
Polynomial functions can be realized by finite size multilayer feedforward neural networks
Author
Toda, Naohiro ; Funahashi, Ken-ichi ; Usui, Shiro
Author_Institution
Dept. of Inf. & Comput. Sci., Toyohashi Univ. of Technol., Japan
fYear
1991
fDate
18-21 Nov 1991
Firstpage
343
Abstract
The authors present an analytic method to construct polynomial functions by multilayer feedforward neural networks. Because the polynomials consist of multiplication operations and linear weighted summations, if the multiplier can be constructed by a neural network, any polynomial function can be represented by a neural network (a single unit already has the function of weighted summation). The authors try to construct a neural network module with one hidden layer that works as a multiplier (it is referred to as a neural multiplier module). It is shown, in principle, that the multiplier can be approximated by a neural network with four hidden units, with arbitrary accuracy on a bounded closed set
Keywords
digital arithmetic; mathematics computing; neural nets; polynomials; hidden layer; linear weighted summations; mathematics computing; multilayer feedforward neural networks; multiplication operations; multiplier; polynomial functions; Artificial neural networks; Computer networks; Data handling; Design methodology; Feedforward neural networks; Multi-layer neural network; Neural networks; Nonlinear systems; Polynomials; Taylor series;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1991. 1991 IEEE International Joint Conference on
Print_ISBN
0-7803-0227-3
Type
conf
DOI
10.1109/IJCNN.1991.170425
Filename
170425
Link To Document