Personalized Federated Learning with Exact Stochastic Gradient Descent
Sotirios Nikoloutsopoulos, Iordanis Koutsopoulos, Michalis K. Titsias

TL;DR
This paper introduces a low-energy, personalized federated learning algorithm based on an exact stochastic gradient descent method, with proven convergence and superior practical performance on multiple datasets.
Contribution
It presents a novel SGD-type algorithm for personalized federated learning that is energy-efficient and comes with rigorous convergence guarantees for non-convex models.
Findings
Lower per-round wall-clock time compared to baselines
Proven convergence rate of O(1/√T) in non-convex settings
Superior classification accuracy on multiple datasets
Abstract
We propose a Stochastic Gradient Descent (SGD)-type algorithm for Personalized Federated Learning which can be particularly attractive for mobile energy-limited regimes due to its low per-client computational cost. The model to be trained includes a set of common weights for all clients, and a set of personalized weights that are specific to each client. At each optimization round, randomly selected clients perform multiple full gradient-descent updates over their client-specific weights towards optimizing the loss function on their own datasets, without updating the common weights. This procedure is energy-efficient since it has low computational cost per client. At the final update of each round, each client computes the joint gradient over both the client-specific and the common weights and returns the gradient of common weights to the server, which allows to perform an exact SGD…
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
MethodsStochastic Gradient Descent
