TL;DR
This paper introduces DLMD-DiffEx, a decentralized optimization algorithm that achieves consensus over noisy, rate-limited networks by exchanging disagreement proxies, balancing noise control and convergence speed.
Contribution
The paper proposes DLMD-DiffEx, a novel algorithm that guarantees convergence under communication constraints by using proxy variables and carefully designed sequences.
Findings
Convergence of local estimates to the optimal solution is proven.
The algorithm effectively manages noise and rate constraints during communication.
Numerical evaluations demonstrate the method's practical performance.
Abstract
In decentralized optimization, multiple nodes in a network collaborate to minimize the sum of their local loss functions. The information exchange between nodes required for this task, is often limited by network connectivity. We consider a setting in which communication between nodes is hindered by both (i) a finite rate-constraint on the signal transmitted by any node, and (ii) additive noise corrupting the signal received by any node. We propose a novel algorithm for this scenario: Decentralized Lazy Mirror Descent with Differential Exchanges (DLMD-DiffEx), which guarantees convergence of the local estimates to the optimal solution under the given communication constraints. A salient feature of DLMD-DiffEx is the introduction of additional proxy variables that are maintained by the nodes to account for the disagreement in their estimates due to channel noise and rate-constraints.…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
