Fetching the paper…
Reading the bibliography…
Let $\Phi\in\mathbb{R}^{m\times n}$ be a sparse Johnson-Lindenstrauss transform [KN14] with $s$ non-zeroes per column.
An algorithm for the machine calculation of complex Fourier series
James W. Cooley and John M. Tukey · 1965
Earlier work this paper cites.
The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
Richard M. Dudley · 1967
Earlier work this paper cites.
Some Random Series of Functions
Jean-Pierre Kahane · 1968
Earlier work this paper cites.
Convex Analysis
R. Rockafellar · 1970
Earlier work this paper cites.
Theorie der Operatorenideale (Zusammenfassung)
Albrecht Pietsch · 1972
Earlier work this paper cites.
Regularité des trajectoires des fonctions aléatoires gaussiennes
Xavier Fernique · 1975
Earlier work this paper cites.
On the moduli of convexity and smoothness
T. Figiel · 1976
Earlier work this paper cites.
Remarques sur un résultat non public de B. Maurey
Gilles Pisier · 1980
Earlier work this paper cites.
Extensions of Lipschitz mappings into a Hilbert space
William B. Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
Inequalities of Bernstein-Jackson-type and the degree of compactness operators in Banach spaces
Bernd Carl · 1985
Earlier work this paper cites.
Inégalités de Khintchine dans C p {C_{p}} ( 1 < p < ∞ ) (1<p<\infty)
François Lust-Piquard · 1986
Earlier work this paper cites.
Probabilistic methods in the geometry of Banach spaces
Gilles Pisier · 1986
Earlier work this paper cites.
Subspaces of small codimension of finite dimensional Banach spaces
Alain Pajor and Nicole Tomczak-Jaegermann · 1986
Earlier work this paper cites.
On Milman’s inequality and random subspaces which escape through a mesh in ℝ n \mathbb{R}^{n}
Yehoram Gordon · 1988
Earlier work this paper cites.
Approximation of zonoids by zonotopes
Jean Bourgain, Joram Lindenstrauss, and Vitali D. Milman · 1989
Earlier work this paper cites.
On the duality problem for entropy numbers of operators
Jean Bourgain, Alain Pajor, Stanisław J. Szarek, and Nicole Tomczak-Jaegermann · 1989
Earlier work this paper cites.
Noncommutative Khintchine and Paley inequalities
François Lust-Piquard and Gilles Pisier · 1991
Earlier work this paper cites.
Regression shrinkage and selection via the Lasso
Robert Tibshirani · 1996
Earlier work this paper cites.
The fourth moment method
Bonnie Berger · 1997
Earlier work this paper cites.
Introduction to Functional Analysis
Reinhold Meise and Dietmar Vogt · 1997
Earlier work this paper cites.
Nonlinear dimensionality reduction by locally linear embedding
Sam T. Roweis and Lawrence K. Saul · 2000
Earlier work this paper cites.
A global geometric framework for nonlinear dimensionality reduction
Joshua B. Tenenbaum, Vin de Silva, and John C. Langford · 2000
Earlier work this paper cites.
Fundamentals of convex analysis
Jean-Baptiste Hiriart-Urruty and Claude Lemaréchal · 2001
Earlier work this paper cites.
Algorithmic applications of low-distortion geometric embeddings
Piotr Indyk · 2001
Earlier work this paper cites.
Finding motifs using random projections
Jeremy Buhler and Martin Tompa · 2002
Earlier work this paper cites.
A box-fitting algorithm in the search for periodic transits
Geza Kovács, Shay Zucker, and Tsevi Mazeh · 2002
Earlier work this paper cites.
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Dimitris Achlioptas · 2003
Earlier work this paper cites.
Problems and results in extremal combinatorics–i
Noga Alon · 2003
Earlier work this paper cites.
Finding frequent items in data streams
Moses Charikar, Kevin Chen, and Martin Farach-Colton · 2004
Earlier work this paper cites.
A pac-style model for learning from labeled and unlabeled data
Maria-Florina Balcan and Avrim Blum · 2005
Earlier work this paper cites.
Low-distortion embeddings of general metrics into the line
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, and Anastasios Sidiropoulos · 2005
Earlier work this paper cites.
Decoding by linear programming
Emmanuel Candès and Terence Tao · 2005
Earlier work this paper cites.
Empirical processes and random projections
Bo’az Klartag and Shahar Mendelson · 2005
Earlier work this paper cites.
The generic chaining: upper and lower bounds of stochastic processes
Michel Talagrand · 2005
Earlier work this paper cites.
A fast random sampling algorithm for sparsifying matrices
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2006
Cited alongside, same era.
Kernels as features: On kernels, margins, and low-dimensional mappings
Maria-Florina Balcan, Avrim Blum, and Santosh Vempala · 2006
Cited alongside, same era.
Near-optimal signal recovery from random projections: universal encoding strategies?
Emmanuel J. Candès and Terence Tao · 2006
Cited alongside, same era.
Compressed sensing
David Donoho · 2006
Cited alongside, same era.
Improved approximation algorithms for large matrices via random projections
Tamás Sarlós · 2006
Cited alongside, same era.
Subspaces and orthogonal decompositions generated by bounded orthogonal systems
O. Guédon, S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann · 2007
Cited alongside, same era.
A technique for extracting highly precise photometry for the two-wheeled Kepler mission
Andrew Vanderburg and John Asher Johnson · 2011
Later among the works it cites.
The johnson-lindenstrauss transform itself preserves differential privacy
Jeremiah Blocki, Avrim Blum, Anupam Datta, and Or Sheffet · 2012
Later among the works it cites.
Fast, linear time hierarchical clustering using the Baire metric
Pedro Contreras and Fionn Murtagh · 2012
Later among the works it cites.
Fast approximation of matrix coherence and statistical leverage
Petros Drineas, Malik Magdon-Ismail, Michael Mahoney, and David Woodruff · 2012
Later among the works it cites.
Approximate nearest neighbor: Towards removing the curse of dimensionality
Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Random projections for manifold learning
C. Hegde, M. Wakin, and R. Baraniuk · 2007
Cited alongside, same era.
Reconstruction and subgaussian operators in asymptotic geometric analysis
S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann · 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.
Iterative hard thresholding for compressed sensing
Thomas Blumensath and Mike E. Davies · 2008
Cited alongside, same era.
The restricted isometry property and its implications for compressed sensing
Emmanuel Candès · 2008
Cited alongside, same era.
Tighter bounds for random projections of manifolds
Kenneth L. Clarkson · 2008
Cited alongside, same era.
Haim Avron, Christos Boutsidis, Sivan Toledo, and Anastasios Zouzias · 2013
Closest in time.
An almost optimal unrestricted fast Johnson-Lindenstrauss transform
Nir Ailon and Edo Liberty · 2013
Closest in time.
Eigenvalues of a matrix in the streaming model
Alexandr Andoni and Huy L. Nguy e ^ ~ \tilde{\hat{\mbox{e}}} n · 2013
Closest in time.
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
Closest in time.
Restricted isometry of Fourier matrices and list decodability of random linear codes
Mahdi Cheraghchi, Venkatesan Guruswami, and Ameya Velingker · 2013
Closest in time.
Low rank approximation and regression in input sparsity time
Kenneth L. Clarkson and David P. Woodruff · 2013
Closest in time.
Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
David L. Donoho and Carrie Grimes · 2013
Closest in time.
New analysis of manifold embeddings and signal recovery from compressive measurements
Armin Eftekhari and Michael B Wakin · 2013
Closest in time.
A Mathematical Introduction to Compressive Sensing
Simon Foucart and Holger Rauhut · 2013
Closest in time.
On model-based RIP-1 matrices
Piotr Indyk and Ilya Razenshteyn · 2013
Closest in time.
Faster ridge regression via the subsampled randomized Hadamard transform
Yichao Lu, Paramveer Dhillon, Dean Foster, and Lyle Ungar · 2013
Closest in time.
Yin Tat Lee and Aaron Sidford · 2013
Closest in time.
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Xiangrui Meng and Michael W. Mahoney · 2013
Closest in time.
OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L. Nguy e ^ ~ \tilde{\hat{\mbox{e}}} n · 2013
Closest in time.
Sparsity lower bounds for dimensionality-reducing maps
Jelani Nelson and Huy L. Nguy e ^ ~ \tilde{\hat{\mbox{e}}} n · 2013
Closest in time.
Random projections for support vector machines
Saurabh Paul, Christos Boutsidis, Malik Magdon-Ismail, and Petros Drineas · 2013
Closest in time.
Subspace embeddings and ℓ p \ell_{p} regression using exponential random variables
David P. Woodruff and Qin Zhang · 2013
Closest in time.
Uniform recovery of fusion frame structured sparse signals
Ulaş Ayaz, Sjoerd Dirksen, and Holger Rauhut · 2014
Closest in time.
Dimensionality reduction for k k -means clustering and low rank approximation
Michael Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Mădălina Persu · 2014
Closest in time.
Personal communication, 2014
Michael B. Cohen · 2014
Closest in time.
Dimensionality reduction with subgaussian matrices: a unified theory
Sjoerd Dirksen · 2014
Closest in time.
Suprema of chaos processes and the restricted isometry property
F. Krahmer, S. Mendelson, and Holger Rauhut · 2014
Closest in time.
Sparser Johnson-Lindenstrauss transforms
Daniel M. Kane and Jelani Nelson · 2014
Closest in time.
The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction, 2014
Kasper Green Larsen and Jelani Nelson · 2014
Closest in time.
New constructions of RIP matrices with fast multiplication and fewer rows
Jelani Nelson, Eric Price, and Mary Wootters · 2014
Closest in time.
Randomized sketches of convex programs with sharp guarantees
M. Pilanci and M. Wainwright · 2014
Closest in time.
Personal communication, 2014
David P. Woodruff · 2014
Closest in time.
Tail bounds via generic chaining
Sjoerd Dirksen · 2015
Closest in time.