Neural Networks with Quadratic VC Dimension

NIPS 1995: Proceedings of the 8th International Conference on Neural Information Processing Systems

Volumn , Issue , 1995, Pages 197-203

  Koiran, Pascal ^a   Sontag, Eduardo D ^b  

^a UNIVERSITÉ DE LYON   (France)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVATION FUNCTIONS; GENERALISATION; NEURAL-NETWORKS; NUMBER OF SAMPLES; VC-DIMENSION;

EID: 85156276965     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. M. ANTHONY and N. L. BIGGS (1992) Computational Learning Theory: An Introduction, Cambridge U. Press.
2. E. B. BAUM and D. HAUSSLER (1989) What size net gives valid generalization?, Neural Computation 1, pp. 151-160.
3. L. BLUM, M. SHUB and S. SMALE (1989) On the theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bulletin of the AMS 21, pp. 1-46.
4. A. BLUMER, A. EHRENFEUCHT, D. HAUSSLER, and M. WARMUTH (1989) Leamabilily and the Vapnik-Chervonenkis dimension, J. of the ACM 36, pp. 929-965.
5. T. M. COVER (1988) Capacity problems for linear machines, in: Pattern Recognition, L. Kanal ed., Thompson Book Co., pp. 283-289.
6. P. GOLDBERG and M. JERRUM (1995) Bounding the Vapnik-Chervonenkis dimension of concept classes parametrized by real numbers, Machine Learning 18, pp. 131-148.
7. M. KARPINSKI and A. MACINTYRE (1995) Polynomial bounds for VC dimension of sig-moidal neural networks, in Proc. 27th ACM Symposium on Theory of Computing, pp. 200208.
8. W. MAASS (1993) Bounds for the computational power and learning complexity of analog neural nets, in Proc. of the 25th ACM Symp. Theory of Computing, pp. 335-344.
9. W. MAASS (1994) Perspectives of current research about the complexity of learning in neural nets, in Theoretical Advances in Neural Computation and Learning, V. P. Roychowd-hury, K. Y. Siu, and A. Orlitsky, editors, Kluwer, Boston, pp. 295-336.
10. B. K. NATARAJAN (1991) Machine Learning: A Theoretical Approach, M. Kaufmann Publishers, San Mateo, CA.
11. E. D. SONTAG (1989) Sigmoids distinguish better than Heavisides, Neural Computation 1, pp. 470-472.
12. E. D. SONTAG (1992) Feedforward nets for interpolation and classification, J. Comp. Syst. Sci 45, pp. 20-48.
13. L. G. VALIANT (1984) A theory of the learnable, Comm. of the ACM 27, pp. 1134-1142
14. V. N. VAPNIK (1982) Estimation of Dependencies Based on Empirical Data, Springer, Berlin.