PeFLL: Personalized Federated Learning by Learning to Learn
Jonathan Scott, Hossein Zakerinia, Christoph H. Lampert

TL;DR
PeFLL introduces a novel personalized federated learning algorithm that enhances model accuracy, reduces client computation, and offers theoretical guarantees for generalization to unseen clients, using a learning-to-learn approach with embedding and hypernetworks.
Contribution
It proposes a new learning-to-learn based method for personalized federated learning that generalizes to future clients and reduces on-device computation.
Findings
Achieves state-of-the-art performance on personalized federated learning benchmarks.
Provides theoretical guarantees for generalization to unseen clients.
Reduces client-side computation and communication requirements.
Abstract
We present PeFLL, a new personalized federated learning algorithm that improves over the state-of-the-art in three aspects: 1) it produces more accurate models, especially in the low-data regime, and not only for clients present during its training phase, but also for any that may emerge in the future; 2) it reduces the amount of on-client computation and client-server communication by providing future clients with ready-to-use personalized models that require no additional finetuning or optimization; 3) it comes with theoretical guarantees that establish generalization from the observed clients to future ones. At the core of PeFLL lies a learning-to-learn approach that jointly trains an embedding network and a hypernetwork. The embedding network is used to represent clients in a latent descriptor space in a way that reflects their similarity to each other. The hypernetwork takes as…
Peer Reviews
Decision·ICLR 2024 poster
- The paper is well-written and the approach is interesting. - Heterogeneity issues can be alleviated with a learning-to-learn approach. - Generalizing to unseen clients makes sense with the embedding model. We intuitively assume that client similarity is dictated by the similarity of their data. Thus, clients with similar embeddings should have similar personalized models. - Algorithms are well detailed and the code is shared in the supplementary materials for reproducibility. - Experiments sho
- I think that the experiments are not sufficient to conclude that PeFLL is superior. You have to demonstrate its improvement on architectures more modern than LeNet as well. It would also be great to report performance on federated datasets other than FEMNIST (e.g. other LEAF datasets). - The computational efficiency of the model is questionable given that the hypernetwork is at least a 100 times bigger than the client's model, and this is only the case for these particular experiments. It migh
This paper addresses a highly relevant problem in an innovative way. The proposed test-time generation of personalized models through a server-side hypernetwork is original and well-described. The paper reads very well, I enjoyed following the authors' red line through the paper.
The weaknesses of this paper revolve around the experimental evaluation, specifically the base-lines that the authors consider given their choice of the experimental setting. The evaluation pipeline raises som questions, detailed below. The comparison to baselines is somewhat unfair, due to a lack of measuring communication overhead. Finally, i believe the discussion of related works should include the topic of Split-Learning, a version of FL where parts of the forward-pass are performed across
1. The idea of taking advantage of learning-to-learn and hypernetworks in personalized FL is interesting. 2. The proposed idea has several advantages. Specifically, any client can obtain its personalized model by conducting only forward propagations. 3. Experimental results show significant performance advantage of the proposed method. 4. Theoretical results are also provided, further strengthening the paper.
1. All experiments are conducted using LeNet-style models, which are relatively outdated. I would like to see the performance on ResNet-style models. 2. In Table 2, the performance of "Local" is missing. Moreover, during experiments, what is the number of local updates for the baselines like Per-FedAvg and pFedMe. How do their performance improve as the number of local updates increases, and can they achieve similar performance compared to the proposed PeFLL?
Code & Models
Videos
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Mental Health via Writing
MethodsHyperNetwork
