Sparser Johnson-Lindenstrauss transforms

Journal of the ACM

Volumn 61, Issue 1, 2014, Pages

  Kane, Daniel M ^a,b   Nelson, Jelani ^c  

^a HARVARD UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

Dimensionality reduction; Johnson Lindenstrauss; Numerical linear algebra; Streaming algorithms

Indexed keywords

ASYMPTOTICALLY OPTIMAL; DIMENSIONALITY REDUCTION; EMBEDDING MATRICES; FIRST CONSTRUCTIONS; JOHNSON-LINDENSTRAUSS; JOHNSON-LINDENSTRAUSS TRANSFORMS; NUMERICAL LINEAR ALGEBRA; STREAMING ALGORITHM;

HARDWARE; SOFTWARE ENGINEERING;

LINEAR ALGEBRA;

EID: 84893229593     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2559902     Document Type: Article

References (39)

1. Dimitris Achlioptas. 2003. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66, 4, 671-687.
2. Nir Ailon and Bernard Chazelle. 2009. The fast Johnson-Lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39, 1, 302-322.
3. Nir Ailon and Edo Liberty. 2009. Fast dimension reduction using Rademacher series on dual BCH codes. Disc. Comput. Geom. 42, 4, 615-630.
4. Nir Ailon and Edo Liberty. 2013. An almost optimal unrestricted fast Johnson-Lindenstrauss transform. ACM Trans. Algor. 9, 3, 21.
5. Noga Alon. 2003. Problems and results in extremal combinatorics I. Discrete Math. 273, 1-3, 31-53.
6. Rosa I. Arriaga and Santosh Vempala. 2006. An algorithmic theory of learning: Robust concepts and random projection. Mach. Learn. 63, 2, 161-182.
7. Vladimir Braverman, Rafail Ostrovsky, and Yuval Rabani. 2010. Rademacher chaos, Random Eulerian graphs and the sparse Johnson-Lindenstrauss transform. CoRR abs/1011.2590.
8. J. Lawrence Carter and Mark N. Wegman. 1979. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 2, 143-154.
9. Moses Charikar, Kevin Chen, and Martin Farach-Colton. 2004. Finding frequent items in data streams. Theoret. Comput. Sci. 312, 1, 3-15.
10. Kenneth L. Clarkson and David P. Woodruff. 2009. Numerical linear algebra in the streaming model. In Proceedings of the 41st ACM Symposium on Theory of Computing (STOC). 205-214.
11. Kenneth L. Clarkson and David P.Woodruff. 2013. Low rank approximation and regression in input sparsity time. In Proceedings of the 45th ACM Symposium on Theory of Computing (STOC). 81-90.
12. Anirban Dasgupta, Ravi Kumar, and Taḿas Sarĺos. 2010. A sparse Johnson-Lindenstrauss transform. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC). 341-350.
13. Sanjoy Dasgupta and Anupam Gupta. 2003. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algor. 22, 1, 60-65.
14. Peter Frankl and Hiroshi Maehara. 1988. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Comb. Theory Ser. B 44, 3, 355-362.
15. Zolt́an F? uredi and J́anos Komĺos. 1981. The eigenvalues of random symmetric matrices. Combinatorica 1, 3, 233-241.
16. David Lee Hanson and Farroll Tim Wright. 1971. A bound on tail probabilities for quadratic forms in independent random variables. Ann. Math. Statist. 42, 3, 1079-1083.
17. Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani. 2012. Approximate nearest neighbor: Towards removing the curse of dimensionality. Theory Comput. 8, 1, 321-350.
18. Aicke Hinrichs and Jan Vyb'iral. 2011. Johnson-Lindenstrauss lemma for circulant matrices. Random Struct. Algor. 39, 3, 391-398.
19. Piotr Indyk. 2001. Algorithmic applications of low-distortion geometric embeddings. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS). 10-33.
20. T. S. Jayram and David P. Woodruff. 2013. Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with subconstant error. ACM Trans. Algor. 9, 3, 26.
21. William B. Johnson and Joram Lindenstrauss. 1984. Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 26, 189-206.
22. Daniel M. Kane, Raghu Meka, and Jelani Nelson. 2011a. Almost optimal explicit Johnson-Lindenstrauss transformations. In Proceedings of the 15th International Workshop on Randomization and Computation (RANDOM). 628-639.
23. Daniel M. Kane and Jelani Nelson. 2010. A derandomized sparse Johnson-Lindenstrauss transform. CoRR abs/1006.3585.
24. Daniel M. Kane and Jelani Nelson. 2012. Sparser Johnson-Lindenstrauss transforms. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1195-1206.
25. Daniel M. Kane, Jelani Nelson, Ely Porat, and David P. Woodruff. 2011b. Fast moment estimation in data streams in optimal space. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC). 745-754.
26. Eyal Kaplan, Moni Naor, and Omer Reingold. 2009. Derandomized constructions of k-wise (almost) independent permutations. Algorithmica 55, 1, 113-133.
27. Felix Krahmer and Rachel Ward. 2011. New and improved Johnson-Lindenstrauss embeddings via the Restricted Isometry Property. SIAM J. Math. Anal. 43, 3, 1269-1281.
28. Jir'i Matousek. 2008. On variants of the Johnson-Lindenstrauss lemma. Rand. Struct. Algor. 33, 2, 142-156.
29. Xiangrui Meng and Michael W. Mahoney. 2013. Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression. In Proceedings of the 45th ACM Symposium on Theory of Computing (STOC). 91-100.
30. Rajeev Motwani and Prabakar Raghavan. 1995. Randomized Algorithms. Cambridge University Press.
31. Jelani Nelson and Huy L. Nguy?̂en. 2013a. OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 117-126.
32. Jelani Nelson and Huy L. Nguy?̂en. 2013b. Sparsity lower bounds for dimensionality reducing maps. In Proceedings of the 45th ACM Symposium on Theory of Computing (STOC). 101-110.
33. Tam'as Sarl'os. 2006. Improved Approximation Algorithms for large matrices via random projections. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 143- 152.
34. Mikkel Thorup and Yin Zhang. 2012. Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation. SIAM J. Comput. 41, 2, 293-331.
35. Santosh Vempala. 2004. The Random Projection Method. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 65, American Mathematical Society.
36. Joachim von zur Gathen and J? urgen Gerhard. 1999. Modern Computer Algebra. Cambridge University Press.
37. Jan Vyb'iral. 2011. A variant of the Johnson-Lindenstrauss lemma for circulant matrices. J. Funct. Anal. 260, 4, 1096-1105.
38. Kilian Q. Weinberger, Anirban Dasgupta, John Langford, Alexander J. Smola, and Josh Attenberg. 2009. Feature hashing for large scale multitask learning. In Proceedings of the 26th Annual International Conference on Machine Learning (ICML). 1113-1120.
39. Eugene P. Wigner. 1955. Characteristic vectors of bordered matrices with infinite dimensions. Ann. Math. 62, 548-564.