We focus the use of row sampling for approximating matrix algorithms. We give applications to matrix multipication; sparse matrix reconstruction; and, ℓ 2 regression. For a matrix A ∈ R m×d which represents m points in d ≪ m dimensions, all of these tasks can be achieved in O(md 2 ) via the singular value decomposition (SVD). For appropriate row-sampling probabilities (which typically depend on the norms of the rows of the m × d left singular matrix of A (the leverage scores), we give row-sampling algorithms with linear (up to polylog factors) dependence on the stable rank of A. This result is achieved through the application of non-commutative Bernstein bounds. We then give, to our knowledge, the first algorithms for computing approximations to the appropriate row-sampling probabilities without going through the SVD of A. Thus, these are the first o(md 2 ) algorithms for row-sampling based approximations to the matrix algorithms which use leverage scores as the sampling probabilities. The techniques we use to approximate sampling according to the leverage scores uses some powerful recent results in the theory of random projections for embedding, and may be of some independent interest. We confess that one may perform all these matrix tasks more efficiently using these same random projection methods, however the resulting algorithms are in terms of a small number of linear combinations of all the rows. In many applications, the actual rows of A have some physical meaning and so methods based on a small number of the actual rows are of interest.
Our sample distribution D F can be seen as a continuous limit of the leverage score sampling distribution, so the condition number bound we show in Theorem 4.1 is very similar to the result in REF .
Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound
ArXiv
ArXiv
Mathematics Computer Science