Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

COLT
2006
Springer

favoriteEmaildiscussreport

166views Machine Learning» more COLT 2006»

The Rademacher Complexity of Linear Transformation Classes

13 years 8 months ago

The Rademacher Complexity of Linear Transformation Classes

Download www.andreas-maurer.eu

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

Real-time Traffic

...nite Dimensional Space | COLT 2006 | Expected Rademacher Complexity | Machine Learning | Multi-task Subspace |

claim paper

Related Content

» Synthesis of maximum margin and multiview learning using unlabeled data

» A Risk Minimization Principle for a Class of Parzen Estimators

» On the Complexity of Linear Prediction Risk Bounds Margin Bounds and Regularization

» Class Separability in Spaces Reduced By Feature Selection

» Constraintbased Model Transformation Tracing the Preservation of Semantic Properties

» Hilbert transformers with a piecewisepolynomialsinusoidal impulse response

» A comparison of generalized linear discriminant analysis algorithms

» On Codes Matroids and Secure Multiparty Computation From Linear SecretSharing Schemes

» On Codes Matroids and Secure Multiparty Computation from Linear Secret Sharing Schemes

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	COLT
Authors	Andreas Maurer

Comments (0)