The authors propose two communication-efficient decentralized optimization algorithms, Compressed Push-Pull (CPP) and Broadcast-like CPP (B-CPP), that achieve linear convergence for minimizing strongly convex and smooth objective functions over general directed networks.
The authors propose a new projection-free decentralized optimization method, the Inexact Primal-Dual Sliding (I-PDS) algorithm, that achieves communication efficiency and reduces the number of data oracle calls compared to prior work.