Fetching the paper…
Reading the bibliography…
We address the problem of minimizing a convex function over the space of large matrices with low rank.
An algorithm for quadratic programming
Frank, M. and Wolfe, P · 1956
Earlier work this paper cites.
Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start
Kuczyński, J. and Woźniakowski, H · 1992
Earlier work this paper cites.
Matching pursuits with time-frequency dictionaries
Mallat, S. and Zhang, Z · 1993
Earlier work this paper cites.
Sparse approximate solutions to linear systems
Natarajan, B · 1995
Earlier work this paper cites.
A l1-norm pca and a heuristic approach
A. Baccini, P. Besse and Falguerolles, A · 1996
Earlier work this paper cites.
Greedy adaptive approximation
Davis, G., Mallat, S., and Avellaneda, M · 1997
Earlier work this paper cites.
Robust factorization of a data matrix
Croux, C. and Filzmoser, P · 1998
Earlier work this paper cites.
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., and Boyd, S.P · 2002
Earlier work this paper cites.
Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition
Pati, YC, Rezaiifar, R., and Krishnaprasad, PS · 2002
Earlier work this paper cites.
Robust l
Ke, Q. and Kanade, T · 2005
Cited alongside, same era.
Generalization error bounds for collaborative prediction with low-rank matrices
Srebro, N., Alon, N., and Jaakkola, T · 2005
Cited alongside, same era.
Uncovering shared structures in multiclass classification
Amit, Yonatan, Fink, Michael, Srebro, Nathan, and Ullman, Shimon · 2007
Cited alongside, same era.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Recht, B., Fazel, M., and Parrilo, P.A · 2007
Cited alongside, same era.
A singular value thresholding algorithm for matrix completion
Cai, J.F., Candes, E.J., and Shen, Z · 2008
Cited alongside, same era.
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Clarkson, K.L · 2008
Cited alongside, same era.
Optspace: A gradient descent algorithm on the grassman manifold for matrix completion
Keshavan, R.H. and Oh, S · 2009
Later among the works it cites.
Matrix factorization techniques for recommender systems
Koren, Yehuda, Bell, Robert M., and Volinsky, Chris · 2009
Later among the works it cites.
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D. and Tropp, J.A · 2009
Later among the works it cites.
Matrix completion with noise
Candes, E.J. and Plan, Y · 2010
Later among the works it cites.
A simple algorithm for nuclear norm regularized problems
Jaggi, M. and Sulovskỳ, M · 2010
Later among the works it cites.
Matrix completion from a few entries
Keshavan, R.H., Montanari, A., and Oh, S · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Subspace pursuit for compressive sensing: Closing the gap between performance and complexity, 2008
Dai, W. and Milenkovic, O · 2008
Cited alongside, same era.
Sparse approximate solutions to semidefinite programs
Hazan, Elad · 2008
Cited alongside, same era.
Exact matrix completion via convex optimization
Candès, E.J. and Recht, B · 2009
Cited alongside, same era.
A simpler approach to matrix completion
Recht, B
Cited in the paper.
Admira: Atomic decomposition for minimum rank approximation
Lee, K. and Bresler, Y · 2010
Later among the works it cites.
Trading accuracy for sparsity in optimization problems with sparsity constraints
Shalev-Shwartz, Shai, Zhang, Tong, and Srebro, Nathan · 2010
Later among the works it cites.
Collaborative filtering with the trace norm: Learning, bounding, and transducing
Shalev-Shwartz, Shai and Shamir, Ohad · 2011
Closest in time.