Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fully Asynchronous Stochastic Coordinate Descent: A Tight Lower Bound on
  the Parallelism Achieving Linear Speedup   We seek tight bounds on the viable parallelism in asynchronous
implementations of coordinate descent that achieves linear speedup. We focus on
asynchronous coordinate descent (ACD) algorithms on convex functions which
consist of the sum of a smooth convex part and a possibly non-smooth separable
convex part.
  We quantify the shortfall in progress compared to the standard sequential
stochastic gradient descent. This leads to a simple yet tight analysis of the
standard stochastic ACD in a partially asynchronous environment, generalizing
and improving the bounds in prior work. We also give a considerably more
involved analysis for general asynchronous environments in which the only
constraint is that each update can overlap with at most q others. The new lower
bound on the maximum degree of parallelism attaining linear speedup is tight
and improves the best prior bound almost quadratically.

23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
14
The categories of this paper are: math-ph
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
22
The categories of this paper are: chao-dyn
20
The categories of this paper are: acc-phys
13
The categories of this paper are: quant-ph
33
The categories of this paper are: plasm-ph
9
The categories of this paper are: nlin
8
The categories of this paper are: hep-ex
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th