Fetching the paper…
Reading the bibliography…
We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case.
The finite dimensional basis problem with an appendix on nets of grassmann manifolds
S. J. Szarek · 1983
Earlier work this paper cites.
Matrix Analysis
R. A. Horn and C. R. Johnson · 1985
Earlier work this paper cites.
The Volume of Convex Bodies and Banach Space Geometry
G. Pisier · 1989
Earlier work this paper cites.
Probability in Banach Spaces: Isoperimetry and Processes
M. Ledoux and M. Talagrand · 1991
Earlier work this paper cites.
Nonlinear programming
D.P. Bertsekas · 1995
Earlier work this paper cites.
Geometry of Cuts and Metric Embeddings
M. Deza and M. Laurent · 1997
Earlier work this paper cites.
Assouad, Fano and Le Cam
B. Yu · 1997
Earlier work this paper cites.
Information-theoretic determination of minimax rates of convergence
Y. Yang and A. Barron · 1999
Earlier work this paper cites.
Local operator theory, random matrices, and Banach spaces
K. R. Davidson and S. J. Szarek · 2001
Earlier work this paper cites.
Matrix completion problems
M. Laurent · 2001
Earlier work this paper cites.
The Concentration of Measure Phenomenon
M. Ledoux · 2001
Earlier work this paper cites.
Strong converse for identification via quantum channels
R. Ahlswede and A. Winter · 2002
Cited alongside, same era.
Matrix Rank Minimization with Applications
M. Fazel · 2002
Cited alongside, same era.
Learning with Matrix Factorizations
N. Srebro · 2004
Cited alongside, same era.
Maximum-margin matrix factorization
N. Srebro, J. Rennie, and T. S. Jaakkola · 2004
Cited alongside, same era.
Generalization error bounds for collaborative prediction with low-rank matrices
N. Srebro, N. Alon, and T. S. Jaakkola · 2005
Cited alongside, same era.
Gradient methods for minimizing composite objective function
Y. Nesterov · 2007
Cited alongside, same era.
Matrix completion from few entries
R. H. Keshavan, A. Montanari, and S. Oh · 2009
Later among the works it cites.
Matrix completion from noisy entries
R. H. Keshavan, A. Montanari, and S. Oh · 2009
Later among the works it cites.
Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix
Z. Lin, A. Ganesh, J. Wright, L. Wu, M. Chen, and Y. Ma · 2009
Later among the works it cites.
Spectral regularization algorithms for learning large incomplete matrices
R. Mazumber, T. Hastie, and R. Tibshirani · 2009
Later among the works it cites.
A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
S. Negahban, P. Ravikumar, M. J. Wainwright, and B. Yu · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Recht, M. Fazel, and P. A. Parrilo · 2007
Cited alongside, same era.
Consistency of trace norm minimization
F. Bach · 2008
Cited alongside, same era.
E. Candès and Y. Plan · 2009
Cited alongside, same era.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht · 2009
Cited alongside, same era.
The power of convex relaxation: Near-optimal matrix completion
E. J. Candes and T. Tao · 2009
Cited alongside, same era.
S. Negahban and M. J. Wainwright · 2009
Later among the works it cites.
A simpler approach to matrix completion
B. Recht · 2009
Later among the works it cites.
A note on sums of independent random matrices after Ahlswede-Winter
R. Vershynin · 2009
Later among the works it cites.
Estimation of high-dimensional low-rank matrices
A. Rohde and A. Tsybakov · 2010
Closest in time.
Collaborative filtering in a non-uniform world: Learning with the weighted trace norm
R. Salakhutdinov and N. Srebro · 2010
Closest in time.
User-friendly tail bounds for matrix martingales
J. Tropp · 2010
Closest in time.