Skip to main content
Conference Proceedings

The rademacher complexity of linear transformation classes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4005 LNAI 65-78
DOI: 10.1007/11776420_8
21Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hubert space H to a finite dimensional space. The results imply generalization guarantees for graph regularization and multi-task subspace learning. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Maurer, A. (2006). The rademacher complexity of linear transformation classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4005 LNAI, pp. 65–78). Springer Verlag. https://doi.org/10.1007/11776420_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free