Fetching the paper…
Reading the bibliography…
This paper presents an improved analysis of a structured dimension-reduction map called the subsampled randomized Hadamard transform.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Extensions of Lipschitz mappings into a Hilbert space
W. B. Johnson and J. Lindenstrauss · 1984
Earlier work this paper cites.
Randomized Algorithms
R. Motwani and P. Raghavan · 1995
Earlier work this paper cites.
On Talagrand’s deviation inequalities for product measures
M. Ledoux · 1996
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. Ahslwede and A. Winter · 2002
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
T. Sarlós · 2006
Earlier work this paper cites.
Sampling from large matrices: An approach through geometric functional analysis
M. Rudelson and R. Vershynin · 2007
Cited alongside, same era.
On the conditioning of random subdictionaries
J. A. Tropp · 2008
Cited alongside, same era.
A fast randomized algorithm for the approximation of matrices
F. Woolfe, E. Liberty, V. Rokhlin, and M. Tygert · 2008
Cited alongside, same era.
The fast Johnson–Lindenstrauss transform and approximate nearest neighbors
N. Ailon and B. Chazelle · 2009
Cited alongside, same era.
Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions
N. Halko, P.-G. Martinsson, and J. A. Tropp · 2009
Cited alongside, same era.
Accelerated dense random projections
E. Liberty · 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
Later among the works it cites.
A note on sampling without replacement from a finite collection of matrices
D. Gross and V. Nesme · 2010
Closest in time.
Almost optimal unrestricted fast Johnson–Lindenstrauss transform
N. Ailon and E. Liberty · 2011
Closest in time.
Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions
N. Halko, P.-G. Martinsson, and J. A. Tropp · 2011
Closest in time.
New and improved Johnson–Lindenstrauss embeddings via the Restricted Isometry Property
F. Krahmer and R. Ward · 2011
Closest in time.
User-friendly tail bounds for sums of random matrices
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. A. Tropp · 2011
Closest in time.