Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Expander Graph and Communication-Efficient Decentralized Optimization   In this paper, we discuss how to design the graph topology to reduce the
communication complexity of certain algorithms for decentralized optimization.
Our goal is to minimize the total communication needed to achieve a prescribed
accuracy. We discover that the so-called expander graphs are near-optimal
choices. We propose three approaches to construct expander graphs for different
numbers of nodes and node degrees. Our numerical results show that the
performance of decentralized optimization is significantly better on expander
graphs than other regular graphs.

9
The categories of this paper are: nlin
37
The categories of this paper are: supr-con
25
The categories of this paper are: patt-sol
17
The categories of this paper are: q-fin
6
The categories of this paper are: astro-ph
31
The categories of this paper are: ao-sci
22
The categories of this paper are: chao-dyn
18
The categories of this paper are: econ
19
The categories of this paper are: eess
23
The categories of this paper are: solv-int
15
The categories of this paper are: nucl-ex
3
The categories of this paper are: physics
16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
0
The categories of this paper are: hep-ph
10
The categories of this paper are: q-bio