Composite geometric concepts and polynomial predictability

Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990

Volumn , Issue , 1990, Pages 273-287

  Long, Philip M ^a   Warmuth, Manfred K ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85060483365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/b978-1-55860-146-8.50024-2     Document Type: Conference Paper

References (24)

1. E.B. Baum On learning a union of halfspaces. Manuscript. May, 1989.
2. E.B. Baum A polynomial algorithm that learns two hidden unit nets. Proceedings of the Third Workshop on Computational Learning Theory , 1990.
3. A. Blum On the Computational Complexity of Training Simple Neural Networks May, 1989 MIT Technical Report MIT/LCS/TR-445
4. A. Blumer A. Ehrenfeucht D. Haussler M.K. Warmuth Occam's razor Information Processing Letters 24 1987 377 380
5. A. Blumer A. Ehrenfeucht D. Haussler M.K. Warmuth Learnability and the Vapnik-Chervonenkis dimension JACM 36 4 1989
6. H. Edelsbrunner Algorithms in Combinatorial Geometry 1984 Springer-Verlag New York
7. O. Goldreich, H. Krwaczyk and M. Luby On the existence of pseudorandom generators. Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science , pp. 12–24, 1988.
8. L.M. Goldschlager The monotone and planar circuit value problems are log space complete for P SIGACT News 9 no. 2 1977 25 29
9. B. Grünbaum Convex Polytopes 1967 Interscience New York
10. D. Haussler, M. Kearns, N. Littlestone and M.K. Warmuth Equivalence of models for polynomial learnability. Information and Control , to appear. An extended abstract appeared in Proceedings of the 1st Workshop on Computational Learning Theory , Morgan Kaufmann, San August, 1988.
11. D. Haussler, N. Littlestone and M.K. Warmuth Predicting {0,1} functions on randomly drawn points. Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science , pp. 100–109. October, 1988.
12. D. Helmbold, R. Sloan and M.K. Warmuth Learning Lattices and Reversible, Commutative Regular Languages. Proceedings of the Third Workshop on Computational Learning Theory , 1990.
13. D. Helmbold and G. Pagallo There is No Continuous Prediction Preserving Reduction Between the Intersection of Two Halfspaces and a Single Halfspace. Manuscript.
14. N. Karmarkar A new polynomial-time algorithm for linear programming Combinatorica 4 1984 373 395
15. L.A. Levin One-way functions and pseudorandom generators Combinatorica 7 4 1987 357 363
16. I. Parberry Parallel Complexity Theory 1987 Pitman London
17. L. Pitt L.G. Valiant Computational limitations on learning from examples JACM 35 4 1988 965 984
18. L. Pitt and M.K. Warmuth Prediction Preserving Reducibility. To appear in a special issue of J.C.S.S. for Structures in Complexity Theory (1989).
19. H. Shvaytser Linear Manifolds are learnable from positive examples. April, 1988. Manuscript.
20. L.G. Valiant A theory of the learnable Communications of the ACM. 27 11 1984 1134 1142
21. V.N. Vapnik Estimation of Dependencies Based on Empirical Data 1982 Springer Verlag New York
22. V.N. Vapnik A.Y. Chervonenkis On the uniform convergence of relative frequencies of events to their probabilities Theoretical Probability and its Applications. 16 2 1971 264 280
23. L.G. Valiant and M.K. Warmuth The border-augmented symmetric difference of halfspaces is learnable. June, 1989. Manuscript.
24. M.K. Warmuth Towards Representation Independence in PAC Learning Analogical and Inductive Inference: International Workshop AII 1989 1989 Springer-Verlag