@inproceedings{02eb78d2f11b4fae89475bdeac291c39,

title = "Learning relatively small classes",

abstract = "We study the sample complexity of proper and improper learning problems with respect to different Lq loss functions. We improve the known estimates for classes which have relatively small covering numbers (log-covering numbers which are polynomial with exponent p < 2) with respect to the Lq norm for q ≥ 2.",

author = "Shahar Mendelson",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001 ; Conference date: 16-07-2001 Through 19-07-2001",

year = "2001",

doi = "10.1007/3-540-44581-1_18",

language = "English",

isbn = "9783540423430",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "273--288",

editor = "David Helmbold and Bob Williamson",

booktitle = "Computational Learning Theory - 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Proceedings",

address = "Germany",

}