Abstract
There have been various studies on approximation ability of feedforward neural networks. The existing studies are, however, only concerned with the density or upper bound estimation on how a multivariate function can be approximated by the networks, and consequently, the essential approximation ability of networks cannot be revealed. In this paper, by establishing both upper and lower bound estimations on approximation order, the essential approximation ability of a class of feedforward neural networks with trigonometric hidden layer units is clarified in terms of the second order modulus of smoothness of approximated function.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barron, A.R.: Universial Approximation Bounds for Superpositions of a Sigmodial Function. IEEE Trans. Inform. Theory 39, 930–945 (1993)
Cao, F.L., Xiong, J.Y.: Steckin-Marchaud-Type Inequality in Connection with L p Approximation for Multivariate Bernstein-Durrmeyer Operators. Chinese Contemporary Mathematics 22(2), 137–142 (2001)
Cao, F.L., Li, Y.M., Xu, Z.B.: Pointwise Approximation for Neural Networks. In: Wang, J., Liao, X.-F., Yi, Z. (eds.) ISNN 2005. LNCS, vol. 3496, pp. 39–44. Springer, Heidelberg (2005)
Chen, T.P., Chen, H.: Universal Approximation to Nonlinear Operators by Neural Networks with Arbitrary Activation Functions and Its Application to Dynamical System. IEEE Trans. Neural Networks 6, 911–917 (1995)
Chen, X.H., White, H.: Improved Rates and Asymptotic Normality for Nonparametric Neural Network Estimators. IEEE Trans. Inform. Theory 45, 682–691 (1999)
Chui, C.K., Li, X.: Approximation by Ridge Functions and Neural Networks with One Hidden Layer. J. Approx. Theory 70, 131–141 (1992)
Cybenko, G.: Approximation by Superpositions of Sigmoidal Function. Math. of Control Signals, and System 2, 303–314 (1989)
Ditzian, Z., Totik, V.: Moduli of Smoothness. Springer, Heidelberg (1987)
Funahashi, K.I.: On the Approximate Realization of Continuous Mappings by Neural Networks. Neural Networks 2, 183–192 (1989)
Hornik, K., Stinchombe, M., White, H.: Multilayer Feedforward Networks are Universal Approximation. Neural Networks 2, 359–366 (1989)
Johnen, H., Scherer, K.: On the Equivalence of the K-Functional and the Moduli of Continuity and Some Applications. In: Schempp, W., Zeller, K. (eds.) FTRTFT 1992. Lecture Notes in Mathematics, vol. 571, pp. 119–140. Springer, Heidelberg (1977)
Kůrkova, V., Kainen, P.C., Kreinovich, V.: Estimates of the Number of Hidden Units and Variation with Respect to Half-Space. Neural Networks 10, 1068–1078 (1997)
Maiorov, V., Meir, R.S.: Approximation Bounds for Smooth Functions in C(R d) by Neural and Mixture Networks. IEEE Trans. Neural Networks 9, 969–978 (1998)
Peetre, J.: On the Connection Between the Theory of Interpolation Spaces and Approximation Theory. In: Alexits, G., Stechkin, S.B. (eds.) Proc. Conf. Construction of Function, Budapest, pp. 351–363 (1969)
Suzuki, S.: Constructive Function Approximation by Three-Layer Artificial Neural Networks. Neural Networks 11, 1049–1058 (1998)
Xu, Z.B., Cao, F.L.: Simultaneous L p-Approximation Order for Neural Networks. Neural Networks 18, 914–923 (2005)
Ito, Y.: Approximation of Functions on a Compact Set by Finite Sums of Sigmoid Function without Scaling. Neural Networks 4, 817–826 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, C., Cao, F., Xu, Z. (2006). The Essential Approximation Order for Neural Networks with Trigonometric Hidden Layer Units. In: Wang, J., Yi, Z., Zurada, J.M., Lu, BL., Yin, H. (eds) Advances in Neural Networks - ISNN 2006. ISNN 2006. Lecture Notes in Computer Science, vol 3971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11759966_11
Download citation
DOI: https://doi.org/10.1007/11759966_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34439-1
Online ISBN: 978-3-540-34440-7
eBook Packages: Computer ScienceComputer Science (R0)