$r$Age-$k$: Communication-Efficient Federated Learning Using Age Factor
Matin Mortaheb, Priyanka Kaswan, Sennur Ulukus

TL;DR
This paper proposes a novel federated learning algorithm that uses age of information metrics to reduce communication costs and handle data heterogeneity by selectively requesting updates and clustering clients.
Contribution
It introduces age vectors at the server to efficiently coordinate updates and group clients, addressing both communication overhead and data heterogeneity simultaneously.
Findings
Outperforms existing communication-efficient methods in training speed.
Effectively groups clients with similar data distributions.
Reduces communication overhead significantly.
Abstract
Federated learning (FL) is a collaborative approach where multiple clients, coordinated by a parameter server (PS), train a unified machine-learning model. The approach, however, suffers from two key challenges: data heterogeneity and communication overhead. Data heterogeneity refers to inconsistencies in model training arising from heterogeneous data at different clients. Communication overhead arises from the large volumes of parameter updates exchanged between the PS and clients. Existing solutions typically address these challenges separately. This paper introduces a new communication-efficient algorithm that uses the age of information metric to simultaneously tackle both limitations of FL. We introduce age vectors at the PS, which keep track of how often the different model parameters are updated from the clients. The PS uses this to selectively request updates for specific…
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
TopicsPrivacy-Preserving Technologies in Data
