Sciweavers

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

67

Voted

CORR
2008
Springer

favoriteEmaildiscussreport

119views Education» more CORR 2008»

Learning Low Rank Matrices from O(n) Entries

14 years 10 months ago

Learning Low Rank Matrices from O(n) Entries

Download www.stanford.edu

How many random entries of an n

Raghunandan H. Keshavan, Andrea Montanari, Sewoong

Real-time Traffic

CORR 2008 | Education | Matrix | Random | Random Entries |

claim paper

Related Content

» Generalization Error Bounds for Collaborative Prediction with LowRank Matrices

» Recovering LowRank and Sparse Components of Matrices from Incomplete and Noisy Observation...

» Rank TraceNorm and MaxNorm

» Learning the Kernel Matrix with LowRank Multiplicative Shaping

» Generalized low rank approximations of matrices

» Spectrally optimal factorization of incomplete matrices

» Uniqueness of LowRank Matrix Completion by Rigidity Theory

» Improved thresholds for rank minimization

» Modeling Appearances with LowRank SVM

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh

Comments (0)