FedNet2Net: Saving Communication and Computations in Federated Learning with Model Growing
Amit Kumar Kundu, Joseph Jaja

TL;DR
FedNet2Net introduces a model-growing federated learning approach that reduces communication and computation costs by starting with a small model and progressively increasing its complexity, achieving efficiency without sacrificing accuracy.
Contribution
This paper presents a novel model-growing scheme for federated learning that minimizes communication and computational costs through function-preserving transformations.
Findings
Significant reduction in communication costs.
Lower client computational requirements.
Achieves comparable accuracy to existing methods.
Abstract
Federated learning (FL) is a recently developed area of machine learning, in which the private data of a large number of distributed clients is used to develop a global model under the coordination of a central server without explicitly exposing the data. The standard FL strategy has a number of significant bottlenecks including large communication requirements and high impact on the clients' resources. Several strategies have been described in the literature trying to address these issues. In this paper, a novel scheme based on the notion of "model growing" is proposed. Initially, the server deploys a small model of low complexity, which is trained to capture the data complexity during the initial set of rounds. When the performance of such a model saturates, the server switches to a larger model with the help of function-preserving transformations. The model complexity increases as…
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 · Stochastic Gradient Optimization Techniques · Adversarial Robustness in Machine Learning
