Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
<|reference_start|>Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity: Effective communication between the server and workers plays a key role in distributed optimization. In this paper, we focus on optimizing the server-to-worker communication, uncovering inefficiencies in prevalent downlink compression approaches. Considering first the pure setup where the uplink communication costs are negligible, we introduce MARINA-P, a novel method for downlink compression, employing a collection of correlated compressors. Theoretical analyses demonstrates that MARINA-P with permutation compressors can achieve a server-to-worker communication complexity improving with the number of workers, thus being provably superior to existing algorithms. We further show that MARINA-P can serve as a starting point for extensions such as methods supporting bidirectional compression. We introduce M3, a method combining MARINA-P with uplink compression and a momentum step, achieving bidirectional compression with provable improvements in total communication complexity as the number of workers increases. Theoretical findings align closely with empirical experiments, underscoring the efficiency of the proposed algorithms.<|reference_end|>
@article{gruntkowska2024improving,
    title={Improving the Worst-Case Bidirectional Communication Complexity for
  Nonconvex Distributed Optimization under Function Similarity},
    author={Kaja Gruntkowska, Alexander Tyurin, Peter Richt'arik},
    journal={arXiv preprint arXiv:2402.06412},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.06412},
    primaryClass={math.OC cs.LG stat.ML}
}