APPROXIMATION CAPABILITY OF LAYERED NEURAL NETWORKS WITH SIGMOID UNITS ON 2 LAYERS

被引:19
作者
ITO, Y
机构
关键词
D O I
10.1162/neco.1994.6.6.1233
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Using only an elementary constructive method, we prove the universal approximation capability of three-layered feedforward neural networks that have sigmoid units on two layers. We regard the Heaviside function as a special case of sigmoid function and measure accuracy of approximation in either the supremum norm or in the L(p)-norm. Given a continuous function defined on a unit hypercube and the required accuracy of approximation, we can estimate the numbers of necessary units on the respective sigmoid unit layers. In the case where the sigmoid function is the Heaviside function, our result improves the estimation of Kurkova (1992). If the accuracy of approximation is measured in the L(p)-norm, our estimation also improves that of Kurkova (1992), even when the sigmoid function is not the Heaviside function.
引用
收藏
页码:1233 / 1243
页数:11
相关论文
共 19 条
[1]  
CARROLL BW, 1989, 89 IJCNN P, V1, P607
[2]  
Cybenko G., 1989, Mathematics of Control, Signals, and Systems, V2, P303, DOI 10.1007/BF02551274
[3]   ON THE APPROXIMATE REALIZATION OF CONTINUOUS-MAPPINGS BY NEURAL NETWORKS [J].
FUNAHASHI, K .
NEURAL NETWORKS, 1989, 2 (03) :183-192
[4]   Representation Properties of Networks: Kolmogorov's Theorem Is Irrelevant [J].
Girosi, Federico ;
Poggio, Tomaso .
NEURAL COMPUTATION, 1989, 1 (04) :465-469
[5]  
Hecht-Nielsen R., 1989, IJCNN: International Joint Conference on Neural Networks (Cat. No.89CH2765-6), P593, DOI 10.1109/IJCNN.1989.118638
[6]  
HECHTNIELSEN R, 1987, 1ST IEEE INT C NEUR, V3, P11
[7]   UNIVERSAL APPROXIMATION OF AN UNKNOWN MAPPING AND ITS DERIVATIVES USING MULTILAYER FEEDFORWARD NETWORKS [J].
HORNIK, K ;
STINCHCOMBE, M ;
WHITE, H .
NEURAL NETWORKS, 1990, 3 (05) :551-560
[8]   APPROXIMATION CAPABILITIES OF MULTILAYER FEEDFORWARD NETWORKS [J].
HORNIK, K .
NEURAL NETWORKS, 1991, 4 (02) :251-257
[9]   MULTILAYER FEEDFORWARD NETWORKS ARE UNIVERSAL APPROXIMATORS [J].
HORNIK, K ;
STINCHCOMBE, M ;
WHITE, H .
NEURAL NETWORKS, 1989, 2 (05) :359-366
[10]   APPROXIMATION OF CONTINUOUS-FUNCTIONS ON R(D) BY LINEAR-COMBINATIONS OF SHIFTED ROTATIONS OF A SIGMOID FUNCTION WITH AND WITHOUT SCALING [J].
ITO, Y .
NEURAL NETWORKS, 1992, 5 (01) :105-115