The bounded injury priority method and the learnability of unions of rectangles

Annals of Pure and Applied Logic

Volumn 77, Issue 2, 1996, Pages 143-168

  Chen, Zhixiang ^a   Homer, Steven ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030605367     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(95)00019-4     Document Type: Article

References (32)

1. [1] D. Angluin, Queries and concept learning, Mach. Learning 2 (1988) 319-342.
2. [2] D. Angluin, Computational learning theory: Survey and selected bibliography, Proc. 24th Ann. Symp. on Theory of Computing (1992) 351-367.
3. [3] P. Auer, On-line learning of rectangles in a noisy environment. Proc. 6th Ann. Workshop on Computational Learning Theory (1993) 253-261.
4. [4] A. Blumer, A. Ehrenfeucht, D. David and M. Warmuth, Learnability and the Vapnik Chervonenkis dimension, J. ACM (1989) 929-965.
5. [5] N. Bshouty, Exact learning via the monotone theory, Proc. 35th Ann. Symp. on Foundations of Computer Science (1993) 302-311.
6. [6] N. Bshouty, On learning discretized geometric concepts, Unpublished manuscript, May 1994.
7. [7] N. Bshouty, Z. Chen and S. Homer, On learning discretized geometric concepts, Proc. 35th Ann. Symp. on Foundations of Computer Science (1994) 54-63.
8. [8] N. Bshouty, P. Goldberg, S. Goldman and D. Mathias, Exact learning of discretized geometric concepts, Technical Report WUCS-94-19, Dept. of Computer Science, Washington University at St. Louis, July 1994.
9. [9] W. Bultman and W. Maass, Fast identification of geometric objects with membership queries, Proc. 4th Ann. ACM Workshop on Computational Learning Theory (1991) 337-353.
10. [10] Z. Chen, Learning unions of two rectangles in the plane with equivalence queries, Proc. 6th Ann. ACM Conf. on Computational Learning Theory (1993) 243-253.
11. [11] Z. Chen and S. Homer, Learning unions of rectangles with queries, Technical Report BUCS-93-10, Dept. of Computer Science, Boston University, July 1993.
12. [12] Z. Chen and W. Maass, On-line learning of rectangles, Proc. 5th Ann. Workshop on Computational Learning Theory (1992) 16-28.
13. [13] Z. Chen and W. Maass, On-line learning of rectangles and unions of rectangles, Mach. Learning 17 (1994) 201-223.
14. [14] P. Cohen and E. Feigenbaum, The Handbook of Artificial Intelligence, Vol. 3 (William Kaufman, Los Altos, CA, 1982).
15. [15] R. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Natl. Acad. Sci. USA 43 (1957) 236-238.
16. [16] P. Goldberg, S. Goldman and D. Mathias, Learning unions of rectangles with membership and equivalence queries, Proc. 7th Ann. ACM Conf. on Computational Learning Theory (1994).
17. [17] J. Jackson, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, Proc. 35th Ann. Symp. on Foundations of Computer Science (1994).
18. [18] N. Littlestone, Learning quickly when irrelevant attributes abound: a new linear threshold algorithm, Mach. Learning 2 (1987) 285-318.
19. [19] P. Long and M. Warmuth, Composite geometric concepts and polynomial predictability, Proc. 3th Ann. Workshop on Computational Learning Theory (1991) 273-287.
20. [20] W. Maass, On the Complexity of Learning on Feed-forward Neural Nets, Lecture Notes, the Advanced School on Computational Learning and Cryptography of the EATCS, Vietri sul Mare, Italy, September 1993.
21. [21] W. Maass and G. Turán, On the complexity of learning from counterexamples, Proc. 30th Ann. Symp. on Foundations of Computer Science (1989) 262-267.
22. [22] W. Maass and G. Turán, On the complexity of learning from counterexamples and membership queries, Proc. 31th Ann. Symp. on Foundations of Computer Science (1990) 203-210.
23. [23] W. Maass and G. Turán, Algorithms and lower bounds for on-line learning of geometric concepts, Report 316 (Oct. 1991), IIG-Report Series, Technische Universität Graz.
24. [24] W. Maass and G. Turán, Lower bound methods and separation results for on-line learning models, Mach. Learning 9 (1992) 107-145.
25. [25] W. Maass and G. Turán, Algorithms and lower bounds for on-line learning of geometric concepts, Mach. Learning 14 (1994) 251-269.
26. [26] W. Maass, G. Turán, How fast can a threshold gate learn, in: G. Drastal, S.J. Hanson and R. Rivest, eds., Computational Learning Theory and Natural Learning Systems: Constraints and Prospects (MIT Press, Cambridge, MA, 1994).
27. [27] W. Maass and M. Warmuth, Efficient learning with virtual threshold gates, Technical Report 395 of the Institutes for Information Processing Graz, August 1994.
28. [28] A. Muchnik, On the unsolvability of the problem of reducibility in the theory of algorithms, Dokl. Akad. Nauk SSSR, N.S. 108 (1956) 194-197.
29. [29] L. Pitt and L. G. Valiant, Computational limitations on learning from examples, J. ACM 35 (1988) 965-984.
30. [30] R. Rivest, Learning decision lists, Mach. Learning 2 (1987) 223-242.
31. [31] R. Soare, Recursively Enumerable Sets and Degrees (Springer, Berlin, 1987).
32. [32] L. Valiant, A theory of the learnable, Comm. ACM 27 (1984) 1134-1142.