Boosting Federated Learning Convergence with Prototype Regularization
Yu Qiao, Huy Q. Le, Choong Seon Hong

TL;DR
This paper proposes a prototype-based regularization method to improve federated learning convergence and accuracy in heterogeneous data environments, demonstrating significant performance gains and faster convergence on benchmark datasets.
Contribution
Introduces a novel prototype regularization strategy that leverages global prototypes to enhance federated learning performance under data heterogeneity.
Findings
Achieves 3.3% and 8.9% accuracy improvements on MNIST and Fashion-MNIST.
Demonstrates faster convergence in heterogeneous data settings.
Outperforms baseline FedAvg in accuracy and convergence speed.
Abstract
As a distributed machine learning technique, federated learning (FL) requires clients to collaboratively train a shared model with an edge server without leaking their local data. However, the heterogeneous data distribution among clients often leads to a decrease in model performance. To tackle this issue, this paper introduces a prototype-based regularization strategy to address the heterogeneity in the data distribution. Specifically, the regularization process involves the server aggregating local prototypes from distributed clients to generate a global prototype, which is then sent back to the individual clients to guide their local training. The experimental results on MNIST and Fashion-MNIST show that our proposal achieves improvements of 3.3% and 8.9% in average test accuracy, respectively, compared to the most popular baseline FedAvg. Furthermore, our approach has a fast…
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 · Recommender Systems and Techniques
