Fetching the paper…
Reading the bibliography…
We study embedding a subset $K$ of the unit sphere to the Hamming cube $\{-1,+1\}^m$.
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.
Efficient search for approximate nearest neighbor in high dimensional spaces
Eyal Kushilevitz, Rafail Ostrovsky, and Yuval Rabani · 2000
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms
Moses S Charikar · 2002
Earlier work this paper cites.
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Alexandr Andoni and Piotr Indyk · 2006
Earlier work this paper cites.
1-bit compressive sensing
Petros T Boufounos and Richard G Baraniuk · 2008
Earlier work this paper cites.
Uniform uncertainty principle for bernoulli and subgaussian ensembles
Shahar Mendelson, Alain Pajor, and Nicole Tomczak-Jaegermann · 2008
Earlier work this paper cites.
On sparse reconstruction from fourier and gaussian measurements
Mark Rudelson and Roman Vershynin · 2008
Earlier work this paper cites.
Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
David Donoho and Jared Tanner · 2009
Earlier work this paper cites.
A sparse johnson: Lindenstrauss transform
Anirban Dasgupta, Ravi Kumar, and Tamás Sarlós · 2010
Earlier work this paper cites.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2010
Earlier work this paper cites.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
Emmanuel J Candes and Yaniv Plan · 2011
Cited alongside, same era.
Toward a unified theory of sparse dimensionality reduction in euclidean space
Jean Bourgain and Jelani Nelson · 2013
Cited alongside, same era.
Revisiting the nystrom method for improved large-scale machine learning
Alex Gittens and Michael W Mahoney · 2013
Cited alongside, same era.
Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors
Laurent Jacques, Jason N Laska, Petros T Boufounos, and Richard G Baraniuk · 2013
Cited alongside, same era.
Fastfood-approximating kernel expansions in loglinear time
Quoc Le, Tamás Sarlós, and Alex Smola · 2013
Cited alongside, same era.
A tight version of the gaussian min-max theorem in the presence of convexity
Chris Thrampoulidis, Samet Oymak, and Babak Hassibi · 2014
Later among the works it cites.
Hashing for similarity search: A survey
Jingdong Wang, Heng Tao Shen, Jingkuan Song, and Jianqiu Ji · 2014
Later among the works it cites.
Sketching as a tool for numerical linear algebra
David P Woodruff · 2014
Later among the works it cites.
Felix X Yu, Sanjiv Kumar, Yunchao Gong, and Shih-Fu Chang · 2014
Later among the works it cites.
Laurent Jacques · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
Yaniv Plan and Roman Vershynin · 2013
Cited alongside, same era.
One-bit compressed sensing with non-gaussian measurements
Albert Ai, Alex Lapanowski, Yaniv Plan, and Roman Vershynin · 2014
Cited alongside, same era.
Dimensionality reduction for k-means clustering and low rank approximation
Michael Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu · 2014
Cited alongside, same era.
Dimension reduction by random hyperplane tessellations
Yaniv Plan and Roman Vershynin · 2014
Cited alongside, same era.
High-dimensional estimation with geometric constraints
Yaniv Plan, Roman Vershynin, and Elena Yudovina · 2014
Cited alongside, same era.
Closest in time.
Isometric sketching of any set via the restricted isometry property
Samet Oymak, Benjamin Recht, and Mahdi Soltanolkotabi · 2015
Closest in time.
Sharp time–data tradeoffs for linear inverse problems
Samet Oymak, Benjamin Recht, and Mahdi Soltanolkotabi · 2015
Closest in time.
Universality laws for randomized dimension reduction, with applications
Samet Oymak and Joel A Tropp · 2015
Closest in time.
The lasso with non-linear measurements is equivalent to one with linear measurements
Christos Thrampoulidis, Ehsan Abbasi, and Babak Hassibi · 2015
Closest in time.
Binary embedding: Fundamental limits and fast algorithm
Xinyang Yi, Constantine Caramanis, and Eric Price · 2015
Closest in time.