Lower bounds for oblivious subspace embeddings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8572 LNCS, Issue PART 1, 2014, Pages 883-894

  Nelson, Jelani ^a   Nguyên, Huy L ^b  

^a HARVARD UNIVERSITY   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EMBEDDINGS; LINEAR SUBSPACE; LOWER BOUNDS;

AUTOMATA THEORY;

EID: 84904157119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-43948-7_73     Document Type: Conference Paper

References (20)

1. Ailon, N., Chazelle, B.: The fast Johnson-Lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39(1), 302-322 (2009)
2. Andoni, A., Nguyên, H. L.: Eigenvalues of a matrix in the streaming model. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1729-1737 (2013)
3. Boutsidis, C., Zouzias, A., Mahoney, M.W., Drineas, P.: Stochastic dimensionality reduction for k-means clustering. CoRR, abs/1110.2897 (2011)
4. Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: Proceedings of the 41st ACM Symposium on Theory of Computing (STOC), pp. 205-214 (2009)
5. Clarkson, K.L., Woodruff, D.P.: Low rank approximation and regression in input sparsity time. In: Proceedings of the 45th ACM Symposium on Theory of Computing (STOC) (2013)
6. Dasgupta, S., Gupta, A.: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1), 60-65 (2003)
7. Demmel, J., Dumitriu, I., Holtz, O.: Fast linear algebra is stable. Numer. Math. 108(1), 59-91 (2007)
8. Hanson, D.L., Wright, F.T.: A bound on tail probabilities for quadratic forms in independent random variables. Ann. Math. Statist. 42(3), 1079-1083 (1971)
9. Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics 26, 189-206 (1984)
10. Kane, D.M., Meka, R., Nelson, J.: Almost optimal explicit Johnson-Lindenstrauss transformations. In: Proceedings of the 15th International Workshop on Randomization and Computation (RANDOM), pp. 628-639 (2011)
11. Mahoney, M.W., Drineas, P., Magdon-Ismail, M., Woodruff, D.P.: Fast approximation of matrix coherence and statistical leverage. In: Proceedings of the 29th International Conference on Machine Learning, ICML (2012)
12. Meng, X., Mahoney, M.W.: 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) (2013)
13. Molinaro, M., Woodruff, D.P., Yaroslavtsev, G.: Beating the direct sum theorem in communication complexity with implications for sketching. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1738-1756 (2013)
14. Nelson, J., Nguyên, H.L.: OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings. In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2013)
15. Nelson, J., Nguyên, H.L.: Sparsity lower bounds for dimensionality-reducing maps. In: Proceedings of the 45th ACM Symposium on Theory of Computing (STOC) (2013)
16. Paul, S., Boutsidis, C., Magdon-Ismail, M., Drineas, P.: Random projections for support vector machines. In: AISTATS (2013)
17. Sarlós, T.: Improved approximation algorithms for large matrices via random projections. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 143-152 (2006)
18. Tao, T.: Topics in random matrix theory. Graduate Studies in Mathematics, vol. 132. American Mathematical Society (2012)
19. Vose, M.D.: A linear algorithm for generating random numbers with a given distribution. IEEE Transactions on Software Engineering 17(9), 972-975 (1991)
20. Williams, V.V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proceedings of the 44th ACM Symposium on Theory of Computing (STOC), pp. 887-898 (2012)