The gradient complexity of linear regression

COLT, pp. 627-647, 2019.

Cited by: 0|Views9
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments