REVIEW 4 cited by
pFedSim: Similarity-Aware Model Aggregation Towards Personalized Federated Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
pFedSim: Similarity-Aware Model Aggregation Towards Personalized Federated Learning
read the original abstract
The federated learning (FL) paradigm emerges to preserve data privacy during model training by only exposing clients' model parameters rather than original data. One of the biggest challenges in FL lies in the non-IID (not identical and independently distributed) data (a.k.a., data heterogeneity) distributed on clients. To address this challenge, various personalized FL (pFL) methods are proposed such as similarity-based aggregation and model decoupling. The former one aggregates models from clients of a similar data distribution. The later one decouples a neural network (NN) model into a feature extractor and a classifier. Personalization is captured by classifiers which are obtained by local training. To advance pFL, we propose a novel pFedSim (pFL based on model similarity) algorithm in this work by combining these two kinds of methods. More specifically, we decouple a NN model into a personalized feature extractor, obtained by aggregating models from similar clients, and a classifier, which is obtained by local training and used to estimate client similarity. Compared with the state-of-the-art baselines, the advantages of pFedSim include: 1) significantly improved model accuracy; 2) low communication and computation overhead; 3) a low risk of privacy leakage; 4) no requirement for any external public information. To demonstrate the superiority of pFedSim, extensive experiments are conducted on real datasets. The results validate the superb performance of our algorithm which can significantly outperform baselines under various heterogeneous data settings.
Forward citations
Cited by 4 Pith papers
-
FedOBP: Federated Optimal Brain Personalization through Cloud-Edge Element-wise Decoupling
FedOBP introduces a quantile-thresholded importance score based on a federated first-order Taylor approximation to select a small set of parameters for personalization, claiming better performance than prior PFL methods.
-
On What We Can Learn from Low-Resolution Data
Low-resolution data improves high-resolution model performance when high-resolution samples are limited, via KL-divergence bounds and experiments on vision transformers and CNNs.
-
Reasoning on the Manifold: Bidirectional Consistency for Self-Verification in Diffusion Language Models
Bidirectional Manifold Consistency (BMC) is a geometric, training-free metric that quantifies stability of reasoning trajectories in diffusion LLMs to enable self-verification, rejection sampling, and alignment withou...
-
Reasoning on the Manifold: Bidirectional Consistency for Self-Verification in Diffusion Language Models
Bidirectional Manifold Consistency measures geometric stability of dLLM trajectories and is claimed to indicate reasoning correctness for diagnosis, rejection sampling, and reward-based alignment.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.