Improving the communication in decentralized manifold optimization through single-step consensus and compression
Jiang Hu, Kangkang Deng

TL;DR
This paper introduces a communication-efficient decentralized optimization algorithm on manifolds that reduces consensus steps to a single iteration and incorporates compression, achieving optimal iteration complexity.
Contribution
It demonstrates that single-step consensus suffices for nonconvex manifold optimization and integrates compression to significantly lower communication costs.
Findings
Achieves $oxed{ ext{O}(rac{1}{ ext{epsilon}})}$ iteration complexity.
Reduces communication per iteration through compression.
Numerical experiments show superior efficiency over existing methods.
Abstract
We are concerned with decentralized optimization over a compact submanifold, where the loss functions of local datasets are defined by their respective local datasets. A key challenge in decentralized optimization is mitigating the communication bottleneck, which primarily involves two strategies: achieving consensus and applying communication compression. Existing projection/retraction-type algorithms rely on multi-step consensus to attain both consensus and optimality. Due to the nonconvex nature of the manifold constraint, it remains an open question whether the requirement for multi-step consensus can be reduced to single-step consensus. We address this question by carefully elaborating on the smoothness structure and the asymptotic 1-Lipschitz continuity associated with the manifold constraint. Furthermore, we integrate these insights with a communication compression strategy to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Slime Mold and Myxomycetes Research · Molecular Communication and Nanonetworks
