Jointly Computation- and Communication-Efficient Distributed Learning
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_ | 1866914262267461632 |
|---|---|
| author | Ren, Xiaoxing Bastianello, Nicola Johansson, Karl H. Parisini, Thomas |
| author_facet | Ren, Xiaoxing Bastianello, Nicola Johansson, Karl H. Parisini, Thomas |
| contents | We address distributed learning problems over undirected networks. Specifically, we focus on designing a novel ADMM-based algorithm that is jointly computation- and communication-efficient. Our design guarantees computational efficiency by allowing agents to use stochastic gradients during local training. Moreover, communication efficiency is achieved as follows: i) the agents perform multiple training epochs between communication rounds, and ii) compressed transmissions are used. We prove exact linear convergence of the algorithm in the strongly convex setting. We corroborate our theoretical results by numerical comparisons with state of the art techniques on a classification task. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_15509 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Jointly Computation- and Communication-Efficient Distributed Learning Ren, Xiaoxing Bastianello, Nicola Johansson, Karl H. Parisini, Thomas Machine Learning Systems and Control Optimization and Control We address distributed learning problems over undirected networks. Specifically, we focus on designing a novel ADMM-based algorithm that is jointly computation- and communication-efficient. Our design guarantees computational efficiency by allowing agents to use stochastic gradients during local training. Moreover, communication efficiency is achieved as follows: i) the agents perform multiple training epochs between communication rounds, and ii) compressed transmissions are used. We prove exact linear convergence of the algorithm in the strongly convex setting. We corroborate our theoretical results by numerical comparisons with state of the art techniques on a classification task. |
| title | Jointly Computation- and Communication-Efficient Distributed Learning |
| topic | Machine Learning Systems and Control Optimization and Control |
| url | https://arxiv.org/abs/2508.15509 |