Stochastic Controlled Averaging for Federated Learning with Communication Compression
By Xinmeng Huang, Ping Li, Xiaoyun Li. International Conference on Learning Representations, 2023
308 citations recorded by the source corpus.
Communication compression, a technique aiming to reduce the information volume to be transmitted over the air, has gained great interests in Federated Learning (FL) for the potential of alleviating its communication overhead. However, communication compression brings forth new challenges in FL due to the interplay of compression-incurred information distortion and inherent characteristics of FL such as partial participation and data heterogeneity. Despite the recent development, the performance of compressed FL approaches has not been fully exploited. The existing approaches either cannot accommodate arbitrary data heterogeneity or partial participation, or require stringent conditions on compression. In this paper, we revisit the seminal stochastic controlled averaging method by proposing an equivalent but more efficient/simplified formulation with halved uplink communication costs. Building upon this implementation, we propose two compressed FL algorithms, SCALLION and SCAFCOM, to support unbiased and biased compression, respectively. Both the proposed methods outperform the existing compressed FL methods in terms of communication and computation complexities. Moreover, SCALLION and SCAFCOM accommodates arbitrary data heterogeneity and do not make any additional assumptions on compression errors. Experiments show that SCALLION and SCAFCOM can match the performance of corresponding full-precision FL approaches with substantially reduced uplink communication, and outperform recent compressed FL methods under the same communication budget.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/fb1a85443b4fcddba3ba38cc78c02073f18aa0c8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Michael G. Rabbat
- Hongyuan Zhan
- Mani Malek
- John Nguyen
- Ashkan Yousefpour
- Kshitiz Malik
- Dzmitry Huba
- Angelia Nedić
In Computer Networks and Communications
- Michael G. Rabbat
- Angelia Nedić
- Alexander Olshevsky
- Aryan Mokhtari
- Ali H. Sayed
- Konstantinos I. Tsianos
- Nicolas Loizou
- Amirhossein Reisizadeh
Citations in the corpus
- Federated Learning with Buffered Asynchronous Aggregation (2021, methodology): “Most previous works analyze synchronous federated learning methods, such as the works in (Lin et al., 2018; Li et al., 2018; Reddi et al., 2020; Li et al., 2020; Stich, 2019; Yu et al., 2019b; Li et al., 2019; Haddadpour and Mahdavi, 2019; Karimireddy et al., 2020).”