On topology, size and generalization of non-linear feed-forward neural networks

被引:22
作者
Rudolph, S
机构
关键词
Pi Theorem; similarity transforms; similarity functions; dimensional homogeneity; neural network generalization; neural network topology;
D O I
10.1016/S0925-2312(96)00059-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The use of similarity transforms in the design and the interpretation of feed-forward neural networks is proposed. The method is based an the so-called Buckingham Theorem or Pi Theorem and is valid for all neural network function approximation problems which belong to the class of dimensionally homogeneous equations. The new design method allows the a priori determination of a minimal topology size of the first and last network layer. Finally, the correct and unique pointwise generalization capability of the new so-called similarity network topology is proved and illustrated using two examples.
引用
收藏
页码:1 / 22
页数:22
相关论文
共 37 条
[1]  
[Anonymous], 1967, DIMENSIONAL ANAL EC
[2]  
[Anonymous], 1992, ARTIFICIAL NEURAL NE
[3]   UNIVERSAL APPROXIMATION BOUNDS FOR SUPERPOSITIONS OF A SIGMOIDAL FUNCTION [J].
BARRON, AR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (03) :930-945
[4]   APPROXIMATION-THEORY AND FEEDFORWARD NETWORKS [J].
BLUM, EK ;
LI, LK .
NEURAL NETWORKS, 1991, 4 (04) :511-515
[5]  
Bluman G. W., 1989, Symmetries and Differential Equations
[6]  
Bluman G. W., 1974, Similarity methods for differential equations
[7]  
Bridgman PW., 1922, DIMENSIONAL ANAL
[8]  
BUCKINGHAM E, 1915, NATURE, V96, P396
[9]  
Cybenko G., 1989, Mathematics of Control, Signals, and Systems, V2, P303, DOI 10.1007/BF02551274
[10]  
ELVERS B, 1990, ULLMANNS ENCY IND B, V1