Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The gradient complexity of linear regression   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 sufficient even for a randomized algorithm.
  Our lower bound is based on a reduction to estimating the least eigenvalue of
a random Wishart matrix. This simple distribution enables a concise proof,
leveraging a few key properties of the random Wishart ensemble.

28
The categories of this paper are: alg-geom
3
The categories of this paper are: physics
20
The categories of this paper are: acc-phys
6
The categories of this paper are: astro-ph
25
The categories of this paper are: patt-sol
7
The categories of this paper are: hep-th
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
30
The categories of this paper are: q-alg
35
The categories of this paper are: mtrl-th
24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
13
The categories of this paper are: quant-ph
31
The categories of this paper are: ao-sci
9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph