Fetching the paper…
Reading the bibliography…
Several recent randomized linear algebra algorithms rely upon fast dimension reduction methods.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
C. C. Paige and M. A. Saunders · 1982
Earlier work this paper cites.
Probability in Banach Spaces: Isoperimetry and Processes
M. Ledoux and M. Talagrand · 1991
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.
On Talagrand’s deviation inequalities for product measures
M. Ledoux · 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.
Fast Monte-Carlo algorithms for approximate matrix multiplication
P. Drineas and R. Kannan · 2001
Earlier work this paper cites.
Randomized Algorithms for Matrix Operations
P. Drineas · 2002
Earlier work this paper cites.
Approximate Nearest Neighbors and the Fast Johnson-Lindenstrauss Transform
N. Ailon and B. Chazelle · 2006
Earlier work this paper cites.
Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication
P. Drineas, R. Kannan, and M. Mahoney · 2006
Earlier work this paper cites.
Fast Monte Carlo algorithms for matrices II: Computing a low rank approximation to a matrix
P. Drineas, R. Kannan, and M. Mahoney · 2006
Earlier work this paper cites.
Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition
P. Drineas, R. Kannan, and M. Mahoney · 2006
Earlier work this paper cites.
Improved Approximation Algorithms for Large Matrices via Random Projections
T. Sarlós · 2006
Earlier work this paper cites.
Randomized algorithms for the low-rank approximation of matrices
E. Liberty, F. Woolfe, P.-G. Martinsson, V. Rokhlin, and M. Tygert · 2007
Earlier work this paper cites.
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes
N. Ailon and E. Liberty · 2008
Earlier work this paper cites.
Algorithmic and statistical challenges in modern largescale data analysis are the focus of MMDS 2008
M. Mahoney, L. Lim, and G. Carlsson · 2008
Cited alongside, same era.
A fast randomized algorithm for overdetermined linear least-squares regression
V. Rokhlin and M. Tygert · 2008
Cited alongside, same era.
A fast randomized algorithm for the approximation of matrices, preliminary report
F. Woolfe, E. Liberty, V. Rokhlin, and M. Tygert · 2008
Cited alongside, same era.
Random projections for the nonnegative least-squares problem
C. Boutsidis and P. Drineas · 2009
Cited alongside, same era.
An Improved Approximation Algorithm for the Column Subset Selection Problem
C. Boutsidis, M. W. Mahoney, and P. Drineas · 2009
Cited alongside, same era.
Exact matrix completion via convex optimization
E. Candés and B. Recht · 2009
Near Optimal Column Based Matrix Reconstruction
C. Boutsidis, P. Drineas, and M. Magdon-Ismail · 2011
Later among the works it cites.
Faster Least Squares Approximation
P. Drineas, M. W. Mahoney, S. Muthukrishnan, and T. Sarlós · 2011
Later among the works it cites.
The spectral norm error of the naive Nystrom extension
A. Gittens · 2011
Later among the works it cites.
Tail bounds for all eigenvalues of a sum of random matrices
A. Gittens and J. Tropp · 2011
Later among the works it cites.
Recovering low-rank matrices from few coefficients in any basis
D. Gross · 2011
Later among the works it cites.
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Numerical linear algebra in the streaming model
K. Clarkson and D. Woodruff · 2009
Cited alongside, same era.
A fast and efficient algorithm for low-rank approximation of a matrix
N. H. Nguyen, T. T. Do, and T. D. Tran · 2009
Cited alongside, same era.
A randomized algorithm for principal component analysis
V. Rokhlin, A. Szlam, and M. Tygert · 2009
Cited alongside, same era.
Blendenpik: Supercharging LAPACK’s least-squares solver
H. Avron, P. Maymounkov, and S. Toledo · 2010
Cited alongside, same era.
Random projections for k k -meanss clustering
C. Boutsidis, A. Zouzias, and P. Drineas · 2010
Cited alongside, same era.
Note on sampling without replacing from a finite collection of matrices
D. Gross and V. Nesme · 2010
Cited alongside, same era.
N. Halko, P.-G. Martinsson, and J. A. Tropp · 2011
Later among the works it cites.
Algorithmic and Statistical Perspectives on Large-Scale Data Analysis
M. Mahoney · 2011
Later among the works it cites.
Low Rank Matrix-valued Chernoff Bounds and Approximate Matrix Multiplication
A. Magen and A. Zouzias · 2011
Later among the works it cites.
Improved analysis of the subsampled randomized Hadamard transform
J. A. Tropp · 2011
Later among the works it cites.
Rich Coresets for Unconstrained Linear Regression
C. Boutsidis, P. Drineas, and M. Magdon-Ismail · 2012
Closest in time.
Low Rank Approximation and Regression in Input Sparsity Time
K. Clarkson and D. Woodruff · 2012
Closest in time.
Fast approximation of matrix coherence and statistical leverage
P. Drineas, M. Magdon-Ismail, M. W. Mahoney, and D. P. Woodruff · 2012
Closest in time.
I. Ipsen and T. Wentworth · 2012
Closest in time.
User-friendly tail bounds for sums of random matrices
J. A. Tropp · 2012
Closest in time.
Faster Robust Linear Regression
K. Clarkson, P. Drineas, M. Magdon-Ismail, M.W. Mahoney, X. Men and D. Woodruff · 2013
Closest in time.