Finiteness results for sigmoidal "neural" networks

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 325-334

  Macintyre, Angus ^a   Sontag, Eduardo D ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; FUNCTION EVALUATION; LEARNING SYSTEMS; LINEAR INTEGRATED CIRCUITS; LOGIC GATES; MATHEMATICAL MODELS;

EXPONENTIATIONS; LEARNABILITY; LEARNING THEORY; LOADING PROBLEM; REAL NUMBER; SAMPLE COMPLEXITY; SPARSE POLYNOMIALS; VC DIMENSION;

NUMBER THEORY; NEURAL NETWORKS;

LEARNING THEORY; STANDARD SIGMOID;

EID: 0027205881     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167192     Document Type: Conference Paper

References (29)

1. Baum, E.B., and D. Haussler, "What size net gives valid generalization?, " Neural Computation 1 (1989): 151160.
2. Bierstone, E., and Pierre D. Milman, "Semianalytic and subanalytic sets, " Inst. Hautes Etudes Sci. Publ. Math. 67(1988): 5-42.
3. Blum, A., and R.L. Rivest, "Training a 3-node neural network is NP-complete, " in Advances in Neural Information Processing Systems 2 (D.S. Touretzky, ed), Morgan Kaufmann, San Mateo, CA, 1990, pp. 9-18.
4. DasGupta, D., and G. Schnitger, "The power of approximating: A comparison of activation functions, " in Advances in Neural Information Processing Systems 5 (Giles, C.L., Hanson, S.J., and Cowan, J.D., eds), Morgan Kaufmann, San Mateo, CA, 1993, to appear.
5. Durbin, R., and D.E. Rumelhart, "Product units: A computationally powerful and biologically plausible extension to backpropagation networks", Neural Computation 1 (1989): 133-142.
6. Goldberg, P., and M. Jerrum, "Bounding the Vapnik- Chervonenkis dimension of concept classes parametrized by real numbers, " submitted.
7. Goldman, S.A., and M.J. Kearns, "On the complexity of teaching, " Proc. Forth ACM Workshop on Computational Learning Theory, July 1991, pp. 303-314.
8. Haussler, D., "Decision theoretic generalizations of the PAC model for neural net and other learning applications, " Inform, and Computation 100(1992): 78-150.
9. Hertz, J., A. Krogh, and R.G. Palmer, Introduction to the Theory of Neural Computation, Addison-Wesley, Redwood City, 1991.
10. Karpinski, M., and T. Werther, "VC dimension and uniform learnability of sparse polynomials and rational functions, " SIAM J. Computing, to appear. (Preprint 8537-CS, Bonn, 1989.).
11. Khovanskii, A.G., Fewnomials, American Mathematical Society, Providence, R.I., 1991.
12. Laskowski, M.C., "Vapnik-Chervonenkis classes of definable sets, " J. London Math. Soc. 2 45(1992): 377-384.
13. Maass, W.G., "Bounds for the computational power and learning complexity of analog neural nets, " Proc. of the 25th A CM Symp. Theory of Computing, 1993.
14. Maass W., G. Schnitger, and E.D. Sontag, "On the computational power of sigmoid versus Boolean threshold circuits, " in Proc. 32nd IEEE Symp. Foundations of Comp. Sci., 1991: 767-776.
15. Macintyre, A.J., and A.J. Wilkie, "Schanuel's conjecture implies the decidability of real exponentiation, " handwritten, Oxford University, 1992.
16. Siegelmann, H.T., and E.D. Sontag, "On the computational power of neural nets, " in Proc. Fifth ACM Workshop on Computational Learning Theory, Pittsburgh, July 1992, 440-449.
17. Siegelmann, H.T., and E.D. Sontag, "Analog computation, neural networks, and circuits, " submitted.
18. Sontag, E.D., "Feedforward nets for interpolation and classification, " J. Comp. Syst. Sci. 45(1992): 20-48.
19. Sontag, E.D., Mathematical Control Theory: Deterministic Finite Dimensional Systems, Springer, New York, 1990.
20. Stengle, G. and Yukich, J.E., "Some new Vapnik- Chervonenkis classes, " The Annals of Statistics 14 (1989): 1441-1446.
21. Sussmann, H.J., "Uniqueness of the weights for minimal feedforward nets with a given input-output map, " Neural Networks 5(1992): 589-593.
22. Sussmann, H.J., "Real analytic desingularization and subanalytic sets: An elementary approach, " Trans. Amer. Math. Soc. 317(1990): 417-461.
23. Tougeron, J.C., "Sur certaines algebres de fonctions an-Alytiques", Seminaire sur la geometrie algebrique reelle, Tome I, II Publ. Math. Univ. Paris VII 24 (1986): 35121.
24. van den Dries, L., "A generalization of the Tarski- Seidenberg theorem, and some nondefinability results, " Bull. AMS 15(1986): 189-193.
25. van den Dries, L., " Tame topology and 0-minimal structures", preprint, University of Illinois, Urbana, 1991-2.
26. van den Dries, L., and C. Miller, "On the real exponential field with restricted analytic functions, " Israel J. Math., to appear.
27. van den Dries, L., A. Macintyre, and D. Marker, "The elementary theory of restricted analytic fields with exponentiation, " Annals of Math., to appear.
28. Wilkie, A.J., "Some model completeness results for expansions of the ordered field of reals by Pfaffian functions, " preprint, Oxford, 1991, submitted.
29. Wilkie, A.J., "Smooth 0-minimal theories and the model completeness of the real exponential field, " preprint, Oxford, 1991, submitted.