Recursive teaching dimension, VC-dimension and sample compression

Journal of Machine Learning Research

Volumn 15, Issue , 2015, Pages 3107-3131

  Doliwa, Thorsten ^a   Fan, Gaojian ^b   Simon, Hans Ulrich ^a   Zilles, Sandra ^c  

^a RUHR UNIVERSITY BOCHUM   (Germany)

^b UNIVERSITY OF ALBERTA   (Canada)

^c UNIVERSITY OF REGINA   (Canada)

Author keywords

Combinatorial parameters; Compression schemes; Recursive teaching; Tail matching algorithm; Upper bounds; Vapnik Chervonenkis dimension

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS;

COMBINATORIAL PARAMETERS; COMPRESSION SCHEME; MATCHING ALGORITHM; UPPER BOUND; VAPNIK-CHERVONENKIS DIMENSIONS;

C (PROGRAMMING LANGUAGE);

EID: 84919752726     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. Dana Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988.
2. Frank Balbach. Measuring teachability using variants of the teaching dimension. Theoretical Computer Science, 397(1-3):94-113, 2008.
3. Shai Ben-David and Nadav Eiron. Self-directed learning and its relation to the VC-dimension and to teacher-directed learning. Machine Learning, 33(1):87-104, 1998.
4. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Learn-ability and the Vapnik-Chervonenkis dimension. Journal of the Association on Computing Machinery, 36(4):929-965, 1989.
5. Malte Darnstädt, Thorsten Doliwa, Hans U. Simon, and Sandra Zilles. Order compression schemes. In Proceedings of the 24th International Conference on Algorithmic Learning Theory, pages 173-187, 2013.
6. Thorsten Doliwa, Hans U. Simon, and Sandra Zilles. Recursive teaching dimension, learning complexity, and maximum classes. In Proceedings of the 21st International Conference on Algorithmic Learning Theory, pages 209-223, 2010.
7. Sally Floyd and Manfred Warmuth. Sample compression, learnability, and the Vapnik-Chervonenkis dimension. Machine Learning, 21(3):1-36, 1995.
8. Sally A. Goldman and Michael J. Kearns. On the complexity of teaching. Journal of Computer and System Sciences, 50(1):20-31, 1995.
9. Sally A. Goldman and Robert H. Sloan. The power of self-directed learning. Machine Learning, 14(1):271-294, 1994.
10. Sally A. Goldman, Ronald L. Rivest, and Robert E. Schapire. Learning binary relations and total orders. SIAM Journal on Computing, 22(5):1006-1034, 1993.
11. David Haussler, Nick Littlestone, and Manfred K. Warmuth. Predicting {0, 1} functions on randomly drawn points. Information and Computation, 115(2):284-293, 1994.
12. David Helmbold, Robert Sloan, and Manfred K. Warmuth. Learning nested differences of intersection-closed concept classes. Machine Learning, 5:165-196, 1990.
13. Christian Kuhlmann. On teaching and learning intersection-closed concept classes. In Proceedings of the 4th European Conference on Computational Learning Theory, pages 168-182, 1999.
14. Eyal Kushilevitz, Nathan Linial, Yuri Rabinovich, and Michael E. Saks. Witness sets for families of binary vectors. J. Comb. Theory, Ser. A, 73(2):376-380, 1996.
15. Dima Kuzmin and Manfred K. Warmuth. Unlabeled compression schemes for maximum classes. Journal of Machine Learning Research, 8:2047-2081, 2007.
16. Nick Littlestone. Learning quickly when irrelevant attributes abound: a new linear threshold algorithm. Machine Learning, 2(4):245-318, 1988.
17. Nick Littlestone and Manfred K. Warmuth. Relating data compression and learnability. Technical Report, UC Santa Cruz, 1996.
18. Wolfgang Maass and György Turán. Lower bound methods and separation results for on-line learning models. Machine Learning, 9:107-145, 1992.
19. Balas K. Natarajan. On learning boolean functions. In Proceedings of the 19th Annual Symposium on Theory of Computing, pages 296-304, 1987.
20. Benjamin I. P. Rubinstein and J. Hyam Rubinstein. A geometric approach to sample compression. Journal of Machine Learning Research, 13:1221-1261, 2012.
21. Benjamin I. P. Rubinstein, Peter L. Bartlett, and J. Hyam Rubinstein. Shifting: One-inclusion mistake bounds and sample compression. Journal of Computer and System Sciences, 75(1):37-59, 2009.
22. Rahim Samei, Pavel Semukhin, Boting Yang, and Sandra Zilles. Sauer's bound for a notion of teaching complexity. In Proceedings of the 23rd International Conference on Algorithmic Learning Theory, pages 96-110, 2012.
23. Norbert Sauer. On the density of families of sets. Journal of Combinatorial Theory, Series A, 13(1):145-147, 1972.
24. Ayumi Shinohara and Satoru Miyano. Teachability in computational learning. New Generation Computing, 8(4):337-348, 1991.
25. Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
26. Vladimir N. Vapnik and Alexey Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theor. Probability and Appl., 16(2):264-280, 1971.
27. Emo Welzl. Complete range spaces, 1987. Unpublished Notes.
28. Sandra Zilles, Steffen Lange, Robert Holte, and Martin Zinkevich. Teaching dimensions based on cooperative learning. In Proceedings of the 21st Annual Conference on Learning Theory, pages 135-146, 2008.
29. Sandra Zilles, Steffen Lange, Robert Holte, and Martin Zinkevich. Models of cooperative teaching and learning. Journal of Machine Learning Research, 12:349-384, 2011.