Sciweavers

COLT
2006
Springer

The Rademacher Complexity of Linear Transformation Classes

14 years 2 months ago
The Rademacher Complexity of Linear Transformation Classes
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 generalization guarantees for graph regularization and multi-task subspace learning.
Andreas Maurer
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where COLT
Authors Andreas Maurer
Comments (0)