22 search results - page 1 / 5 » The Rademacher Complexity of Linear Transformation Classes |
COLT
2006
Springer
14 years 2 months ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
ESANN
2006
14 years 17 days ago
2006
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...
NIPS
2007
14 years 17 days ago
2007
This paper1 explores the use of a Maximal Average Margin (MAM) optimality principle for the design of learning algorithms. It is shown that the application of this risk minimizati...
NIPS
2008
14 years 18 days ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
ICPR
2006
IEEE
14 years 5 months ago
2006
IEEE
We investigated the geometrical complexity of several high-dimensional, small sample classification problems and its changes due to two popular feature selection procedures, forw...