The Rademacher Complexity of Linear Transformation Classes
Lists
Only you see this
Abstract
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a finite dimensional space. The results imply generalization guarantees for graph regularization and multi-task subspace learning.
BibTeX
@inproceedings{maurer2006rademacher,
author = {Andreas Maurer},
title = {{The Rademacher Complexity of Linear Transformation Classes}},
booktitle = {Conference on Learning Theory},
year = {2006},
url = {https://openreview.net/forum?id=-CokUQn2Zm-},
}Loading related content...