A fast and efficient algorithm for low-rank approximation of a matrix

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 215-224

  Nguyen, Nam H ^a   Do, Thong T ^a   Tran, Trac D ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

ADAPTIVE SAMPLING; APPROXIMATION PROCESS; APPROXIMATION SOLUTION; EFFICIENT ALGORITHM; ERROR APPROXIMATIONS; FAST IMPLEMENTATION; FROBENIUS NORM; HADAMARD; HIGH PROBABILITY; LEAST SQUARE APPROXIMATIONS; LOW RANK APPROXIMATIONS; LOW-RANK MATRICES; MATRIX; N-MATRIX; ORTHONORMAL; PRE-PROCESSING STEP; SPECTRAL NORMS; THEORY;

COMPUTATION THEORY; MATRIX ALGEBRA; PROBABILITY;

APPROXIMATION ALGORITHMS;

EID: 70350672596     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536446     Document Type: Conference Paper

References (20)

1. P. Drineas, R. Kanna, and M. W. Mahoney, "Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix," SIAM Journal on Computing, vol. 36.
2. G. H. Golub and C. F. V. Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, 1983.
3. A. Frieze, R. Kannan, and S. Vempala, "Fast monte-carlo algorithms for finding low-rank approximations," Journal of the ACM, vol. 51.
4. P. Drineas, M. W. Mahoney, and S. Muthukrishna, "Subspace sampling and relative error matrix approximation: Column-based methods," Proc. of APPROX-RANDOM, pp. 316-326, 2006.
5. S. Har-Peled, "Low rank matrix approximation in linear time,"Manuscript.
6. A. Deshpande and S. Vempala, "Adaptive sampling and fast low-rank matrix approximation," Proc. of the 10th International Workshop on Randomization and Computation, 2006.
7. A. Deshpande, L. Rademacher, S. Vempala, and G. Wang, "Matrix approximation and projective clustering via volume sampling," Theory of Computing, vol. 2, pp. 225 - 247, 2006.
8. T. Sarlós, "Improve approximation algorithms for large matrices via random projection," Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 143-152, 2006.
9. N. Ailon and B. Chazzelle, "Approximation nearest neighbors and the fast jonson-lindenstrauss transform," Proc. of the 38th Annual ACM Symposium on Theory of Computing, pp. 557-563, 2006.
10. T. T. Do, T. D. Tran, and L. Gan, "Fast compressive sampling with structurally random matrices," Proc. IEEE Int. Conf. of Acous., Speech and Signal Proc., pp. 3369-3372, May 2008.
11. F. Woolfe, E. Liberty, V. Rokhlin, and M. Tygert, "A fast randomized algorithm for the approximation of matrices," UCLA University Technical report No. 1386.
12. P. Drineas, M. W. Mahoney, S. Muthukrishnan, and T. Sarlos, "Faster least square approximation," under review, SIAM Journal on Computing, 2008.
13. N. Ailon and E. Liberty, "Fast dimension reduction using rademacher series on dual BCH codes," Symposium on Discrete Algorithms (SODA), pp. 1-9, 2008.
14. N. Ailon and E. Liberty, "Dense fast random projections and lean walsh transforms," Workshop on Randomization and Computation (RANDOM), pp. 512-522, 2008.
15. B. Simon, Trace Ideals and Their Applications, American Mathematical Society, 2005.
16. M. Talagrand, "New concentration inequalities in product space," Inventionnes Math, vol. 126, pp. 505-563, 1996.
17. M. Ledoux, The Concentration of Measure Phenomenon, American Mathematical Society, 2001.
18. A. Buchholz, "Operator Khintchine inequality in non-commutative probability," Math. Annalen, vol. 319, 2001.
19. M. Rudelson and R. Vershynin, "Sampling from large matrices: an approach through geometric functional analysis," to appear in Journal of the ACM.
20. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, 2005.