dl.acm.org
Low-Rank Approximation and Regression in Input Sparsity Time | Journal of the ACM
We design a new distribution over m × n matrices S so that, for any fixed n × d matrix A of rank r, with probability at least 9/10, ∥SAx∥2 = (1 ± ε)∥Ax∥2 simultaneously for all x ∈ Rd. Here, m is boun...