Fetching the paper…
Reading the bibliography…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space.
Extensions of lipschitz mappings into a hilbert space
William B Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
Probability in Banach Spaces: isoperimetry and processes , volume 23
Michel Ledoux and Michel Talagrand · 1991
Earlier work this paper cites.
Problems and results in extremal combinatorics—i
Noga Alon · 2003
Earlier work this paper cites.
Approximate nearest neighbors and the fast johnson-lindenstrauss transform
Nir Ailon and Bernard Chazelle · 2006
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.
On sparse reconstruction from fourier and gaussian measurements
Mark Rudelson and Roman Vershynin · 2008
Earlier work this paper cites.
Locality-sensitive binary codes from shift-invariant kernels
Maxim Raginsky and Svetlana Lazebnik · 2009
Earlier work this paper cites.
Semantic hashing
Ruslan Salakhutdinov and Geoffrey Hinton · 2009
Earlier work this paper cites.
Spectral hashing
Yair Weiss, Antonio Torralba, and Rob Fergus · 2009
Cited alongside, same era.
Iterative quantization: A procrustean approach to learning binary codes
Yunchao Gong and Svetlana Lazebnik · 2011
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 · 2011
Cited alongside, same era.
New and improved johnson-lindenstrauss embeddings via the restricted isometry property
Felix Krahmer and Rachel Ward · 2011
Cited alongside, same era.
Hashing with graphs
Wei Liu, Jun Wang, Sanjiv Kumar, and Shih-Fu Chang · 2011
Cited alongside, same era.
Hamming distance metric learning
Mohammad Norouzi, David M Blei, and Ruslan Salakhutdinov · 2012
Learning binary codes for high-dimensional data using bilinear projections
Yunchao Gong, Sanjiv Kumar, Henry A Rowley, and Svetlana Lazebnik · 2013
Later among the works it cites.
Optimal bounds for johnson-lindenstrauss transforms and streaming problems with subconstant error
TS Jayram and David P Woodruff · 2013
Later among the works it cites.
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
Yaniv Plan and Roman Vershynin · 2013
Later among the works it cites.
New constructions of rip matrices with fast multiplication and fewer rows
Jelani Nelson, Eric Price, and Mary Wootters · 2014
Later among the works it cites.
Dimension reduction by random hyperplane tessellations
Yaniv Plan and Roman Vershynin · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
An almost optimal unrestricted fast johnson-lindenstrauss transform
Nir Ailon and Edo Liberty · 2013
Cited alongside, same era.
Restricted isometry of fourier matrices and list decodability of random linear codes
Mahdi Cheraghchi, Venkatesan Guruswami, and Ameya Velingker · 2013
Cited alongside, same era.
Felix X Yu, Sanjiv Kumar, Yunchao Gong, and Shih-Fu Chang · 2014
Later among the works it cites.
Fast binary embeddings with gaussian circulant matrices: improved bounds
Sjoerd Dirksen and Alexander Stollenwerk · 2018
Closest in time.