Fetching the paper…
Reading the bibliography…
We consider low-rank reconstruction of a matrix using its columns and we present asymptotically optimal algorithms for both spectral norm and Frobenius norm reconstruction.
Numerical methods for solving linear least squares problems
G. Golub · 1965
Earlier work this paper cites.
Some applications of the rank revealing QR factorization
T.F. Chan and P.C. Hansen · 1992
Earlier work this paper cites.
Efficient algorithms for computing a strong rank-revealing QR factorization
M. Gu and S.C. Eisenstat · 1996
Earlier work this paper cites.
Fast Monte-Carlo algorithms for finding low-rank approximations
A. Frieze, R. Kannan, and S. Vempala · 1998
Earlier work this paper cites.
Clustering in large graphs and matrices
P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay · 1999
Earlier work this paper cites.
Competitive recommendation systems
P. Drineas, I. Kerenidis, and P. Raghavan · 2002
Earlier work this paper cites.
Adaptive sampling and fast low-rank matrix approximation
A. Deshpande and S. Vempala · 2006
Earlier work this paper cites.
Matrix approximation and projective clustering via volume sampling
Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang · 2006
Earlier work this paper cites.
Polynomial time algorithm for column-row based relative-error low-rank matrix approximation
P. Drineas, M.W. Mahoney, and S. Muthukrishnan · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
T. Sarlos · 2006
Cited alongside, same era.
The many proofs of an identity on the norm of oblique projections
D. Szyld · 2006
Cited alongside, same era.
Sampling-based dimension reduction for subspace approximation
A. Deshpande and K. R. Varadarajan · 2007
Cited alongside, same era.
Randomized algorithms for the low-rank approximation of matrices
E. Liberty, F. Woolfe, P.G. Martinsson, V. Rokhlin, and M. Tygert · 2007
Cited alongside, same era.
Efficient subspace approximation algorithms
N. D. Shyamalkumar and K. R. Varadarajan · 2007
Cited alongside, same era.
Twice-ramanujan sparsifiers
J.D. Batson, D.A. Spielman, and N. Srivastava · 2009
Cited alongside, same era.
A randomized algorithm for principal component analysis
V. Rokhlin, A. Szlam, and M. Tygert · 2009
Later among the works it cites.
Efficient volume sampling for row/column subset selection
A. Deshpande and L. Rademacher · 2010
Later among the works it cites.
Coresets and sketches for high dimensional subspace approximation problems
D. Feldman, M. Monemizadeh, C. Sohler, and D. Woodruff · 2010
Later among the works it cites.
A unified framework for approximating and clustering data
D. Feldman and M. Langberg · 2011
Closest in time.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
N. Halko, P.G. Martinsson, and J.A. Tropp · 2011
Closest in time.
Optimal column-based low-rank matrix reconstruction
V. Guruswami and A. K. Sinop · 2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An improved approximation algorithm for the column subset selection problem
C. Boutsidis, M.W. Mahoney, and P. Drineas · 2009
Cited alongside, same era.
Numerical linear algebra in the streaming model
K.L. Clarkson and D.P. Woodruff · 2009
Cited alongside, same era.
CUR matrix decompositions for improved data analysis
M. W. Mahoney and P. Drineas · 2009
Cited alongside, same era.
A Matrix Hyperbolic Cosine Algorithm and Applications
A. Zouzias · 2012
Closest in time.
Faster Subset Selection for Matrices and Applications
H. Avron and C. Boutsidis · 2013
Closest in time.