On learning of sigmoid neural networks

Complexity

Volumn 6, Issue 4, 2001, Pages 39-45

  Najarian, Kayvan ^a  

^a University of North Carolina at Charlotte   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2142811044     PISSN: 10762787     EISSN: 10990526     Source Type: Journal    
DOI: 10.1002/cplx.1041     Document Type: Article

References (14)

1. L.G. Valiant. A theory of learnable. Comm. ACM, 1984, pp. 1134–1142.
2. W. Hoeffding. Probability inequalities for sum of bounded random variables. Amer. Statistical Assoc. Math. Soc. Transactions 17: 1961, pp. 277–364.
3. M.C. Campi and P.R. Kumar. Learning dynamical systems in a stationary environment. Proc. 31th IEEE Conf. Decision and Control. 16(2): 1996, pp. 2308–2311.
4. E. Weyer, R.C. Williamson, and I.M.Y. Mareels. Sample complexity of least squares identification of FIR models. 13th IFAC Triennial World Congress 1996, pp. 239–243.
5. K. Najarian, Guy A. Dumont, and Michael S. Davies. PAC learning in Nonlinear FIR Models. International Journal of Adaptive Control and Signal Processing 15(1): 2001, pp. 37–52.
6. K. Najarian, G.A. Dumont, M.S. Davies, N.E. Heckman. Learning of FIR Models Under Uniform Distribution. Proc. of The American Control Conference, San Diego, U.S.A. (ACC1999), June 1999, pp. 864–869.
7. K. Najarian, G.A. Dumont, and M.S. Davies. A learning-theory-based training algorithm for variable-structure dynamic neural modeling. Proc. Inter. Joint Conf. Neural Networks (IJCNN99), 1999.
8. S. Grossberg. Neural networks and natural intelligence. Cambridge, The MIT Press, 1988.
9. M. Vidyasagar. A Theory of Learning and Generalization, New York, Springer, 1997.
10. A.N. Kolmogorov and V.M. Tikhomirov. ϵ-Entropy and ϵ-capacity of sets in functional spaces. Amer. Math. Soc. Transl., 17: 1961, pp. 227–364.
11. V.N. Vapnik and A.Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications. 16(2): 1971, pp. 264–280.
12. D.S. Modha and E. Masry. Minimum complexity regression estimation with weakly dependent observation. IEEE Trans. Information Theory 42(6): Nov. 1996, pp. 2133–2145.
13. P. Bartlett. The sample complexity of pattern classificaiton with neural networks: the size of the weights is more important than the size of the network. Amer. Statistical Assoc. Math. Soc. Transactions 17: 1996, pp. 277–364.
14. K. Najarian, G.A. Dumont, and M.S. Davies. Complexity Control of Neural Networks Using Learning Theory, Part I: Theory. Proc. IASTED Conf. on Signal and Image Processing (SIP 2000) Nov. 2000.