Setwise Coordinate Descent for Dual Asynchronous Decentralized Optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912349195075584 |
|---|---|
| author | Costantini, Marina Liakopoulos, Nikolaos Mertikopoulos, Panayotis Spyropoulos, Thrasyvoulos |
| author_facet | Costantini, Marina Liakopoulos, Nikolaos Mertikopoulos, Panayotis Spyropoulos, Thrasyvoulos |
| contents | In decentralized optimization over networks, synchronizing the updates of all nodes incurs significant communication overhead. For this reason, much of the recent literature has focused on the analysis and design of asynchronous optimization algorithms where nodes can activate anytime and contact a single neighbor to complete an iteration together. However, most works assume that the neighbor selection is done at random based on a fixed probability distribution (e.g., uniform), a choice that ignores the optimization landscape at the moment of activation. Instead, in this work we introduce an optimization-aware selection rule that chooses the neighbor providing the highest dual cost improvement (a quantity related to a dualization of the problem based on consensus). This scheme is related to the coordinate descent (CD) method with the Gauss-Southwell (GS) rule for coordinate updates; in our setting however, only a subset of coordinates is accessible at each iteration (because each node can communicate only with its neighbors), so the existing literature on GS methods does not apply. To overcome this difficulty, we develop a new analytical framework for smooth and strongly convex functions that covers our new class of setwise CD algorithms -- a class that applies to both decentralized and parallel distributed computing scenarios -- and we show that the proposed setwise GS rule can speed up the convergence in terms of iterations by a factor equal to the size of the largest coordinate set. We analyze extensions of these algorithms that exploit the knowledge of the smoothness constants when available and otherwise propose an algorithm to estimate these constants. Finally, we validate our theoretical results through extensive simulations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_19004 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Setwise Coordinate Descent for Dual Asynchronous Decentralized Optimization Costantini, Marina Liakopoulos, Nikolaos Mertikopoulos, Panayotis Spyropoulos, Thrasyvoulos Optimization and Control 90C25, 68T99 G.1.6; I.2.11; I.2.6; C.2.4 In decentralized optimization over networks, synchronizing the updates of all nodes incurs significant communication overhead. For this reason, much of the recent literature has focused on the analysis and design of asynchronous optimization algorithms where nodes can activate anytime and contact a single neighbor to complete an iteration together. However, most works assume that the neighbor selection is done at random based on a fixed probability distribution (e.g., uniform), a choice that ignores the optimization landscape at the moment of activation. Instead, in this work we introduce an optimization-aware selection rule that chooses the neighbor providing the highest dual cost improvement (a quantity related to a dualization of the problem based on consensus). This scheme is related to the coordinate descent (CD) method with the Gauss-Southwell (GS) rule for coordinate updates; in our setting however, only a subset of coordinates is accessible at each iteration (because each node can communicate only with its neighbors), so the existing literature on GS methods does not apply. To overcome this difficulty, we develop a new analytical framework for smooth and strongly convex functions that covers our new class of setwise CD algorithms -- a class that applies to both decentralized and parallel distributed computing scenarios -- and we show that the proposed setwise GS rule can speed up the convergence in terms of iterations by a factor equal to the size of the largest coordinate set. We analyze extensions of these algorithms that exploit the knowledge of the smoothness constants when available and otherwise propose an algorithm to estimate these constants. Finally, we validate our theoretical results through extensive simulations. |
| title | Setwise Coordinate Descent for Dual Asynchronous Decentralized Optimization |
| topic | Optimization and Control 90C25, 68T99 G.1.6; I.2.11; I.2.6; C.2.4 |
| url | https://arxiv.org/abs/2504.19004 |