Improved Approximation Algorithms for Large Matrices via Random Projections

Several results appeared that show significant reduction in time for matrix multiplication, singular value decomposition as well as linear (lscr 2) regression, all based on data dependent random sampling. Our key idea is that low dimensional embeddings can be used to eliminate data dependence and provide more versatile, linear time pass efficient matrix computation. Our main contribution is summarized as follows. 1) Independent of the results of Har-Peled and of Deshpande and Vempala, one of the first - and to the best of our knowledge the most efficient - relative error (1 + epsi) parA A k par F approximation algorithms for the singular value decomposition of an m times n matrix A with M non-zero entries that requires 2 passes over the data and runs in time O ( (M (k/epsi+k log k) + (n+m) (k/epsi+k log k) 2) log (1/sigma) ). 2) The first o (nd 2) time (1 + epsi) relative error approximation algorithm for n times d linear (lscr 2) regression. 3) A matrix multiplication and norm approximation algorithm that easily applies to implicitly given matrices and can be used as a black box probability boosting tool