1 paper across 1 session
For communication-efficient decentralized learning, we propose two new graphs: the k-peer exponential graph and the null-cascade graph.
