Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Sampling

23 Nov 2015Michael B. CohenCameron MuscoChristopher Musco

We present a new algorithm for finding a near optimal low-rank approximation of a matrix $A$ in $O(nnz(A))$ time. Our method is based on a recursive sampling scheme for computing a representative subset of $A$'s columns, which is then used to find a low-rank approximation... (read more)

PDF Abstract

No code implementations yet. Submit your code now