DocumentCode :
2695397
Title :
An asymptotic singular value decomposition analysis of nonlinear multilayer neural networks
Author :
Goggin, Shelly D D ; Gustafson, Karl E. ; Johnson, Kristina M.
Author_Institution :
Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA
fYear :
1991
fDate :
8-14 Jul 1991
Firstpage :
785
Abstract :
The nonlinear multilayer neural network architecture is analyzed as a set of coupled Moore-Penrose pseudo-inverse equations, which arise from an asymptotic approximation to each unit´s output equation. A linear analysis of these equations is performed through singular value decomposition (SVD) of the input matrix and a matrix of the desired hidden values. This analysis exactly determines the values of the weights and the optimal number of hidden units needed for a given set of training patterns. The outputs of the resulting neural network asymptotically approach the desired output values for each input pattern. This analysis provides an approach to determining the computational complexity of constructing nonlinear feedforward neural networks. A simple example of the XOR problem illustrates the results of the analysis
Keywords :
computational complexity; matrix algebra; neural nets; XOR problem; asymptotic approximation; asymptotic singular value decomposition analysis; computational complexity; coupled Moore-Penrose pseudo-inverse equations; hidden units; input matrix; linear analysis; nonlinear feedforward neural networks; nonlinear multilayer neural networks; training patterns; Computational complexity; Couplings; Feedforward neural networks; Matrix decomposition; Multi-layer neural network; Neural networks; Nonlinear equations; Pattern analysis; Performance analysis; Singular value decomposition;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1991., IJCNN-91-Seattle International Joint Conference on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-0164-1
Type :
conf
DOI :
10.1109/IJCNN.1991.155278
Filename :
155278
Link To Document :
بازگشت