Fetching the paper…
Reading the bibliography…
We give a simple algorithm to efficiently sample the rows of a matrix while preserving the p-norms of its product with vectors.
On the stochastic matrices associated with certain queueing processes
F. G. Foster · 1953
Earlier work this paper cites.
Finite dimensional subspaces of l p l_{p}
D. Lewis · 1978
Earlier work this paper cites.
More on embedding subspaces of l p l_{p} in l r n l^{n}_{r}
Gideon Schechtman · 1987
Earlier work this paper cites.
Approximation of zonoids by zonotopes
J. Bourgain, J. Lindenstrauss, and V. Milman · 1989
Earlier work this paper cites.
Comparison theorems, random geometry and some limit theorems for empirical processes
M. Ledoux and M. Talagrand · 1989
Earlier work this paper cites.
Embedding subspaces of l 1 l_{1} into l 1 N l^{N}_{1}
Michel Talagrand · 1990
Earlier work this paper cites.
Probability in Banach Spaces: isoperimetry and processes
Michel Ledoux and Michel Talagrand · 1991
Earlier work this paper cites.
Banach Spaces for Analysts
P. Wojtaszczyk · 1991
Earlier work this paper cites.
Embedding subspaces of l p l_{p} in l p n l_{p}^{n}
Michel Talagrand · 1995
Earlier work this paper cites.
The Volume of Convex Bodies and Banach Space Geometry
G. Pisier · 1999
Earlier work this paper cites.
Independent component analysis: Algorithms and applications
A. Hyvärinen and E. Oja · 2000
Earlier work this paper cites.
Strong converse for identification via quantum channels
Rudolf Ahlswede and Andreas Winter · 2002
Earlier work this paper cites.
Compressive sampling
J. Candés, E · 2006
Cited alongside, same era.
Sampling algorithms for l2 regression and applications
Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan · 2006
Cited alongside, same era.
Lp-moments of random vectors via majorizing measures
Olivier Guédon and Mark Rudelson · 2007
Cited alongside, same era.
Sampling from large matrices: An approach through geometric functional analysis
Mark Rudelson and Roman Vershynin · 2007
Cited alongside, same era.
Sampling algorithms and coresets for ℓ p \ell_{\mbox{p}} regression
Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael W. Mahoney · 2009
Cited alongside, same era.
A note on sums of independent random matrices after ahlswede-winter
R. Vershynin · 2009
Cited alongside, same era.
Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices
Ioannis Koutis, Alex Levin, and Richard Peng · 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.
The fast cauchy transform and faster robust linear regression
Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, and David P. Woodruff · 2013
Later among the works it cites.
Runtime guarantees for regression problems
Hui Han Chin, Aleksander Madry, Gary L. Miller, and Richard Peng · 2013
Later among the works it cites.
Low rank approximation and regression in input sparsity time
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C&O 750: Randomized algorithms, winter 2011, lecture 11 notes
Nicholas Harvey · 2011
Cited alongside, same era.
Graph sparsification by effective resistances
D. Spielman and N. Srivastava · 2011
Cited alongside, same era.
Subspace embeddings for the l1-norm with applications
Christian Sohler and David P. Woodruff · 2011
Cited alongside, same era.
Twice-Ramanujan sparsifiers
Joshua Batson, Daniel A Spielman, and Nikhil Srivastava · 2012
Cited alongside, same era.
Fast approximation of matrix coherence and statistical leverage
Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, and David P. Woodruff · 2012
Cited alongside, same era.
Kenneth L. Clarkson and David P. Woodruff · 2013
Later among the works it cites.
Iterative row sampling
Mu Li, G.L. Miller, and R. Peng · 2013
Later among the works it cites.
Yin Tat Lee and Aaron Sidford · 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.
Uniform sampling for matrix approximation
Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2014
Closest in time.
Path-finding methods for linear programming : Solving linear programs in O ~ ( r a n k ) \tilde{O}(\sqrt{rank}) iterations and faster algorithms for maximum flow
Yin Tat Lee and Aaron Sidford · 2014
Closest in time.