Fetching the paper…
Reading the bibliography…
Random sampling has become a critical tool in solving massive matrix problems.
Generalized inversion of modified matrices
Carl D Meyer, Jr · 1973
Earlier work this paper cites.
Extensions of Lipschitz mappings into a Hilbert space
William Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
Latent semantic indexing: A probabilistic analysis
Christos H. Papadimitriou, Hisao Tamaki, Prabhakar Raghavan, and Santosh Vempala · 1998
Earlier work this paper cites.
Fast monte carlo algorithms for matrices i: Approximating matrix multiplication
Petros Drineas, Ravi Kannan, and Michael W. Mahoney · 2004
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A. Spielman and Shang-Hua Teng · 2004
Earlier work this paper cites.
Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix
Petros Drineas, Ravi Kannan, and Michael W. Mahoney · 2006
Earlier work this paper cites.
Fast monte carlo algorithms for matrices iii: Computing a compressed approximate matrix decomposition
Petros Drineas, Ravi Kannan, and Michael W. Mahoney · 2006
Earlier work this paper cites.
Sampling algorithms for l2 regression and applications
Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
Tamás Sarlós · 2006
Earlier work this paper cites.
Relative-error $cur$ matrix decompositions
Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan · 2008
Earlier work this paper cites.
A fast randomized algorithm for overdetermined linear least-squares regression
Vladimir Rokhlin and Mark Tygert · 2008
Cited alongside, same era.
Graph sparsification by effective resistances
Daniel A. Spielman and Nikhil Srivastava · 2008
Cited alongside, same era.
Numerical linear algebra in the streaming model
Kenneth L. Clarkson and David P. Woodruff · 2009
Cited alongside, same era.
Blendenpik: Supercharging lapack’s least-squares solver
Haim Avron, Petar Maymounkov, and Sivan Toledo · 2010
Cited alongside, same era.
Effective resistances, statistical leverage, and applications to linear equation solving
Petros Drineas and Michael W. Mahoney · 2010
Cited alongside, same era.
Approaching optimality for solving sdd linear systems
I. Koutis, G.L. Miller, and R. Peng · 2010
Can matrix coherence be efficiently and accurately estimated?
Mehryar Mohri and Ameet Talwalkar · 2011
Later among the works it cites.
Matrix concentration
Nick Harvey · 2012
Later among the works it cites.
Sampling methods for the nystrom method
Sanjiv Kumar, Mehryar Mohri, and Ameet Talwalkar · 2012
Later among the works it cites.
Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L. Nguyen · 2012
Later among the works it cites.
User-friendly tail bounds for sums of random matrices
Joel A. Tropp · 2012
Later among the works it cites.
Low rank approximation and regression in input sparsity time
Kenneth L Clarkson and David P Woodruff · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Effective stiffness: Generalizing effective resistance sampling to finite element matrices
Haim Avron and Sivan Toledo · 2011
Cited alongside, same era.
A fast randomized algorithm for orthogonal projection
E. S. Coakley, Vladimir Rokhlin, and Mark Tygert · 2011
Cited alongside, same era.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
N. Halko, P. G. Martinsson, and J. A. Tropp · 2011
Cited alongside, same era.
Randomized algorithms for matrices and data
Michael W. Mahoney · 2011
Cited alongside, same era.
Iterative row sampling
Mu Li, G.L. Miller, and R. Peng · 2013
Later among the works it cites.
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Xiangrui Meng and Michael W. Mahoney · 2013
Later among the works it cites.
Lsrn: A parallel iterative solver for strongly over- or underdetermined systems
Xiangrui Meng, Michael A. Saunders, and Michael W. Mahoney · 2014
Closest in time.