Sciweavers

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

8

COLT
2005
Springer

favoriteEmaildiscussreport

122views Machine Learning» more COLT 2005»

Rank, Trace-Norm and Max-Norm

13 years 10 months ago

Rank, Trace-Norm and Max-Norm

Download www.cs.huji.ac.il

We study the rank, trace-norm and max-norm as complexity measures of matrices, focusing on the problem of ﬁtting a matrix with matrices having low complexity. We present generalization error bounds for predicting unobserved entries that are based on these measures. We also consider the possible relations between these measures. We show gaps between them, and bounds on the extent of such gaps.

Nathan Srebro, Adi Shraibman

Real-time Traffic

COLT 2005 | Complexity Measures | Generalization Error Bounds | Low Complexity |

claim paper

Related Content

» Consistency of trace norm minimization

» The Generalized TraceNorm and its Application to StructurefromMotion Problems

» Limitations of matrix completion via trace norm minimization

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	COLT
Authors	Nathan Srebro, Adi Shraibman

Comments (0)