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.

• Type: Conference
• Year: 2006
• Where: COLT
• Authors: Andreas Maurer
• Keywords: ...nite Dimensional Space, COLT 2006, Expected Rademacher Complexity, Machine Learning, Multi-task Subspace