Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Complexity of Parallel Coordinate Descent   In this work we study the parallel coordinate descent method (PCDM) proposed
by Richt\'arik and Tak\'a\v{c} [26] for minimizing a regularized convex
function. We adopt elements from the work of Xiao and Lu [39], and combine them
with several new insights, to obtain sharper iteration complexity results for
PCDM than those presented in [26]. Moreover, we show that PCDM is monotonic in
expectation, which was not confirmed in [26], and we also derive the first high
probability iteration complexity result where the initial levelset is
unbounded.

0
The categories of this paper are: hep-ph
34
The categories of this paper are: chem-ph
5
The categories of this paper are: gr-qc
15
The categories of this paper are: nucl-ex
9
The categories of this paper are: nlin
21
The categories of this paper are: adap-org
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
27
The categories of this paper are: comp-gas
32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
12
The categories of this paper are: nucl-th
36
The categories of this paper are: cmp-lg
33
The categories of this paper are: plasm-ph
37
The categories of this paper are: supr-con
3
The categories of this paper are: physics