Learning Relatively Small Classes

Authors:
Shahar Mendelson
Affiliations:
-
Venue:
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Year:
2001

Citing 3
Cited 0

Learning in Neural Networks: Theoretical Foundations

Learning in Neural Networks: Theoretical Foundations
The importance of convexity in learning with squared loss

IEEE Transactions on Information Theory
Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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 Lq norm for q ≥ 2.