Noise-tolerant distribution-free learning of general geometric concepts

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 151-160

  Bshouty, Nader H ^a   Goldman, Sally A ^b   Mathias, H David ^b   Suri, Subhash ^b   Tamaki, Hisao ^c  

^a UNIVERSITY OF CALGARY   (Canada)

^b WASHINGTON UNIVERSITY   (United States)

^c IBM RESEARCH TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATION THEORY; GEOMETRY; POLYNOMIAL APPROXIMATION; COMPUTATIONAL GEOMETRY; LEARNING SYSTEMS; POLYNOMIALS; RANDOM PROCESSES; SET THEORY; SPURIOUS SIGNAL NOISE;

ARBITRARY POINTS; BOOLEAN COMBINATIONS; DISTRIBUTION-FREE; GEOMETRIC CONCEPTS; INDICATOR FUNCTIONS; POLYNOMIAL NUMBER; POLYNOMIAL-TIME ALGORITHMS; STATISTICAL QUERIES;

C (PROGRAMMING LANGUAGE); LEARNING ALGORITHMS;

ARBITRARY POINT; BOOLEAN INDICATOR FUNCTION; GENERAL GEOMETRIC CONCEPTS; NOISE TOLERANT ALGORITHM; NOISE TOLERANT DISTRIBUTION FREE LEARNING; PAC LEARNABLE; POLYNOMIAL TIME ALGORITHM;

EID: 0029711244     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237854     Document Type: Conference Paper

References (34)

1. Noga Alon, Joel H. Spencer, and Paul Brdos, editors. The Probabilistic Method. Wiley, 1992.
2. Dana Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988.
3. Dana Angluin and Philip Laird. Learning from noisy examples. Machine Learning, 2(4):343-370, 1988.
4. Javed A. Aslam and Scott E. Decatur. General bounds on statistical query learning and PAC learning with noise via hypothesis boosting. In 34th Annual Symposium on Foundations of Computer Science, pages 282-291, November 1993.
5. Javed A. Aslam and Scott E. Decatur. Specification and simulation of statistical query algorithms for efficiency and noise tolerance. In Proceedings of the Eighth Annual ACM Conference on Computational Learning Theory, pages 437-446, July 1995.
6. Peter Auer, Stephen Kwek, Wolfgang Maass, and Manfred Warmuth. On-line prediction of depth two linear threshold circuits. Unpublished manuscript, 1995.
7. Eric B. Baum. On learning a union of half spaces. Journal of Complexity, 6(1):67-101, March 1990.
8. Eric B. Baum. The perceptron algorithm is fast for nonmalicious distributions. Neural Computation, 2:248-260, 1990.
9. Eric B. Baum. Neural net algorithms that learn in polynomial time from examples and queries. IEEE Transactions on Neural Networks, 2(1):5-19, January 1991.
10. Bonnie Berger, John Rompel, and Peter W. Shor. Efficient NC algorithms for set cover with applications to learning and geometry. Journal of Computer and System Sciences, 49(2):454-477, 1994.
11. Avrim L. Blum and Ronald L. Rivest. Training a 3-node neural net is NP-Complete. Neural Networks, 5(1):117-127, 1992.
12. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Occam's razor. Information Processing Letters, 24:377-380, April 1987.
13. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the Association for Computing Machinery, 36(4):929-965, October 1989.
14. Hervé Brönnimann and Michael T. Goodrich. Almost optimal set covers in finite VC-dimenison. In 10th Annual Symposium on Computational Geometry, pages 293-302, May 1994.
15. Nader H. Bshouty, Zhixiang Chen, and Steve Homer. On learning discretized geometric concepts. In 35th Annual Symposium on Foundations of Computer Science, pages 54-63, November 1994.
16. Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, and H. David Mathias. Exact learning of discretized concepts. Technical Report WUCS-94-19, Washington University, 1994. An abbreviated version appeared in COLT 94.
17. Nader H. Bshouty, Sally A. Goldman, and H. David Mathias. Noise-tolerant parallel learning of geometric concepts. In Proceedings of the Eighth Annual ACM Conference on Computational Learning Theory, pages 345-352, July 1995.
18. Zhixiang Chen and Steven Homer. The bounded injury priority method and the learnability of unions of rectangles. Unpublished manuscript, May 1994.
19. V. Chvatal. A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4(3):233-235, 1979.
20. Scott E. Decatur. Statistical queries and faulty PAC oracles. In Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, pages 262-268. ACM Press, New York, ny, 1993.
21. Herbert Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987.
22. Andrzej Ehrenfeucht and David Haussier. A general lower bound on the number of examples needed for learning. Information and Computation, 82(3):247-251, 1989.
23. Mike Frazier, Sally Goldman, Nina Mishra, and Leonard Pitt. Learning from a consistently ignorant teacher. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, July 1994.
24. Paul W. Goldberg, Sally A. Goldman, and H. David Mathias. Learning unions of rectangles with membership and equivalence queries. Technical Report WUCS-93-46, Washington University, November 1993.
25. David Haussler and Emo Welzl. Epsilon-nets and simplex range queries. Discrete Computational Geometry, 2:127-151, 1987.
26. David Haussler. Generalizing the PAC model: sample size bounds from metric dimension-based uniform convergence results. In 30th Annual Symposium on Foundations of Computer Science, pages 40-45, October 1989.
27. David S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, pages 256-278, 1974.
28. Micahel Kearns. Efficient noise-tolerant learning from statistical queries. In Proc. 25th Annu, ACM Sympos. Theory Comput., pages 392-401. ACM Press, New York, ny, 1993.
29. Philip M. Long and Manfred K. Warmuth. Composite geometric concepts and polynomial predictability. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 273-287. Morgan Kaufmann, August 1990.
30. László Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, pages 383-390, 1975.
31. Leslie Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, November 1984.
32. Leslie Valiant. Learning disjunctions of conjunctions. In Proceedings of the 9th International Joint Conference on Artificial Intelleigence, vol. 1, pages 560-566, 1985.
33. V. N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and Its Applications, XVI (2): 264-280, 1971.
34. Dan E. Willard. Polygon retrieval. SIAM Journal on Computing, 11(1):149-165, February 1982.