3 search results - page 1 / 1 » A Fast Augmented Lagrangian Algorithm for Learning Low-Rank ... |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
SIAMJO
2011
13 years 1 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...