The gradient complexity of linear regression
COLT, pp. 627-647, 2019.
We investigate the computational complexity of several basic linear algebra primitives, including largest eigenvector computation and linear regression, in the computational model that allows access to the data via a matrix-vector product oracle. We show that for polynomial accuracy, $\Theta(d)$ calls to the oracle are necessary and suf...More
PPT (Upload PPT)