Improved analysis of the subsampled randomized hadamard transform

Advances in Adaptive Data Analysis

Volumn 3, Issue 1-2, 2011, Pages 115-126

  Tropp, Joel A ^a  

^a California Institute of Technology   (United States)

Author keywords

Dimension reduction; numerical linear algebra; random matrix; WalshHadamard matrix

Indexed keywords

DIMENSION REDUCTION; EUCLIDEAN GEOMETRY; HADAMARD TRANSFORMS; NUMERICAL LINEAR ALGEBRA; RANDOM MATRIX; TIME-OPTIMAL; WALSH-HADAMARD;

VECTORS;

MATHEMATICAL TRANSFORMATIONS;

EID: 80052645998     PISSN: 17935369     EISSN: 17937175     Source Type: Journal    
DOI: 10.1142/S1793536911000787     Document Type: Conference Paper

References (19)

1. Ailon, N. and Chazelle, B. (2009). The fast Johnson-Lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput., 31(1): 302-322.
2. Ailon, N. and Liberty, E. (2010). Almost optimal unrestricted fast Johnson-Lindenstrauss transform, Available at arXiv:1005.5513.
3. Ahslwede, R. and Winter, A. (2002). Strong converse for identification via quantum channels. IEEE Trans. Inform. Theory, 48(3): 569-579. (Pubitemid 34239788)
4. Gross, D. and Nesme, V. (2010). A note on sampling without replacement from a finite collection of matrices, Available at arXiv:1001.2738.
5. Halko, N., Martinsson, P.-G. and Tropp, J. A. (2009). Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions, ACM Report 2009-05, Caltech, Pasadena.
6. Halko, N., Martinsson, P.-G. and Tropp, J. A. (2011). Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions. SIAM Rev., 53(2): 217-288.
7. Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc., 58: 13-30.
8. Johnson, W. B. and Lindenstrauss, J. (1984). Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math., 26: 189-206.
9. Krahmer, F. and Ward, R. (2010). New and improved Johnson-Lindenstrauss embeddings via the Restricted Isometry Property, Available at arXiv:1009.0744.
10. Ledoux, M. (1996). On Talagrand's deviation inequalities for product measures. ESAIM Probab. Stat., 1: 63-87.
11. Ledoux, M. (2001). The Concentration of Measure Phenomenon, Number 89 in MSM. American Mathematical Society, Providence.
12. Liberty, E. (2009). Accelerated Dense Random Projections, Ph.D. Thesis, Computer Science Department Yale University, New Haven, CT.
13. Motwani, R. and Raghavan, P. (1995). Randomized Algorithms, Cambridge University Press.
14. Nguyen, N. H., Do, T. T. and Tran, T. D. (2009). A fast and efficient algorithm for low-rank approximation of a matrix. STOC '09: Proceedings of 41st Annual ACM Symposium Theory of Computing.
15. Rudelson, M. and Vershynin, R. (2007). Sampling from large matrices: an approach through geometric functional analysis. J. Assoc. Comput. Mach., 54(4): Art. 21, 19pp. (electronic).
16. Sarĺos, T. (2006). Improved approximation algorithms for large matrices via random projections. Proceedings of 47th Annual IEEE Symposium Foundations of Computer Science (FOCS), pp. 143-152. (Pubitemid 351175504)
17. Tropp, J. A. (2008). On the conditioning of random subdictionaries. Appl. Comput. Harmon. Anal., 25: 1-24. (Pubitemid 351721018)
18. Tropp, J. A. (2010). User-friendly tail bounds for sums of random matrices, ACM Report 2010-01, Caltech, Pasadena.
19. Woolfe, F., Liberty, E., Rokhlin, V. and Tygert, M. (2008). A fast randomized algorithm for the approximation of matrices. Appl. Comput. Harmon. Anal., 25(3): 335-366.