Learning boxes in high dimension

Algorithmica (New York)

Volumn 22, Issue 1-2, 1998, Pages 76-90

  Beimel, A ^a   Kushilevitz, E ^b  

^a RUTGERS UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Boxes; Decision trees; Discrete geometric objects; Exact learning; Hankel matrices; Multiplicity automata

Indexed keywords

EID: 2342543752     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00013835     Document Type: Article

References (27)

1. D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988.
2. P. Auer. On-line learning of rectangles in noisy environments. In Proc. 6th Annual ACM Workshop on Computational Learning Theory, pages 253-261, 1993.
3. A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz, and S. Varricchio. Learning functions represented as multiplicity automata. Submitted for publication, 1997.
4. Preliminary version: On the applications of multiplicity automata in learning. In Proc. 37th Annual IEEE Symp. on Foundations of Computer Science, pages 349-358, 1996.
5. A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz, and S. Varricchio. On the applications of multiplicity automata in learning. In Proc. the 37th Annual IEEE Symp. on Foundations of Computer Science, pages 349-358, 1996.
6. S. Ben-David, N. H. Bshouty, and E. Kushilevitz. A composition theorem for learning algorithms with applications to geometric concept classes. In Proc. 29th Annual ACM Symp. on the Theory of Computing, pages 324-333, 1997.
7. F. Bergadano, D. Catalano, and S. Varricchio. Learning sat-k-DNF formulas from membership queries. In Proc. 28th Annual ACM Symp. on the Theory of Computing, pages 126-130, 1996.
8. A. Blum and S. Rudich. Fast learning of k-term DNF formulas with queries. Journal of Computer and System Sciences, 51(3):367-373, 1995.
9. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36:929-965, 1989.
10. N. H. Bshouty. Exact learning via the monotone theory. In Proc. 34th Annual IEEE Symp. on Foundations of Computer Science, pages 302-311, 1993.
11. Journal version: Information and Computation, 123(1):146-153, 1995.
12. N. H. Bshouty. Simple learning algorithms using divide and conquer. In Proc. 8th Annual ACM Workshop on Computational Learning Theory, pages 447-453, 1995.
13. N. H. Bshouty, Z. Chen, and S. Homer. On learning discretized geometric concepts. In Proc. 35th Annual IEEE Symp. on Foundations of Computer Science, pages 54-63, 1994.
14. N. H. Bshouty, P. W. Goldberg, S. A. Goldman, and H. D. Mathias. Exact Learning of Discretized Geometric Concepts. Technical Report WUCS-94-19, Washington University, 1994.
15. N. H. Bshouty, S. A. Goldman, H. D. Mathias, S. Suri, and H. Tamaki. Noise-tolerant distribution-free learning of general geometric concepts. In Proc. 28th Annual ACM Symp. on the Theory of Computing, pages 151-160, 1996.
16. Z. Chen and S. Homer. The bounded injury priority method and the learnability of unions of rectangles. Annals of Pure and Applied Logic, 77(2):143-168, 1996.
17. Z. Chen and W. Maass. On-line learning of rectangles and unions of rectangles. Machine Learning, 17(2/3):23-50, 1994.
18. P. W. Goldberg, S. A. Goldman, and H. D. Mathias. Learning unions of boxes with membership and equivalence queries. In Proc. 7th Annual ACM Workshop on Computational Learning Theory, 1994.
19. J. C. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. In Proc. 35th Annual IEEE Symp. on Foundations of Computer Science, pages 42-53, 1994.
20. J. C. Jackson. The Harmonic Sieve: A Novel Application of Fourier Analysis to Machine Learning Theory and Practice. Ph.D. thesis, Technical Report CMU-CS-95-184, School of Computer Science, Carnegie Mellon University, 1995.
21. E. Kushilevitz. A simple algorithm for learning O(log n)-term DNF. Information Processing Letters, 61(6):289-292, 1997.
22. N. Littlestone. Learning when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
23. P. M. Long and M. K. Warmuth. Composite geometric concepts and polynomial predictability. Information and Computation, 113(2):230-252, 1994.
24. W. Maass and G. Turán. On the complexity of learning from counterexamples. In Proc. 30th Annual IEEE Symp. on Foundations of Computer Science, pages 262-273, 1989.
25. W. Maass and G. Turán. Algorithms and lower bounds for on-line learning of geometrical concepts. Machine Learning, 14:251-269, 1994.
26. W. Maass and M. K. Warmuth. Efficient learning with virtual threshold gates. In Proc. 12th International Conf. on Machine Learning, pages 378-386. Morgan Kaufmann, San Mateo, CA, 1995.
27. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.