Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dimension-Free Iteration Complexity of Finite Sum Optimization Problems   Many canonical machine learning problems boil down to a convex optimization
problem with a finite sum structure. However, whereas much progress has been
made in developing faster algorithms for this setting, the inherent limitations
of these problems are not satisfactorily addressed by existing lower bounds.
Indeed, current bounds focus on first-order optimization algorithms, and only
apply in the often unrealistic regime where the number of iterations is less
than $\mathcal{O}(d/n)$ (where $d$ is the dimension and $n$ is the number of
samples). In this work, we extend the framework of (Arjevani et al., 2015) to
provide new lower bounds, which are dimension-free, and go beyond the
assumptions of current bounds, thereby covering standard finite sum
optimization methods, e.g., SAG, SAGA, SVRG, SDCA without duality, as well as
stochastic coordinate-descent methods, such as SDCA and accelerated proximal
SDCA.

7
The categories of this paper are: hep-th
37
The categories of this paper are: supr-con
12
The categories of this paper are: nucl-th
33
The categories of this paper are: plasm-ph
13
The categories of this paper are: quant-ph
9
The categories of this paper are: nlin
3
The categories of this paper are: physics
18
The categories of this paper are: econ
25
The categories of this paper are: patt-sol
28
The categories of this paper are: alg-geom
30
The categories of this paper are: q-alg
31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
11
The categories of this paper are: hep-lat