arXiv AI

Influence-Oriented Personalized Federated Learning

Influence-Oriented Personalized Federated Learning (FedC^2I) introduces a framework that quantifies both client-level and class-level influence to enable adaptive parameter aggregation in federated learning. By modeling inter-client influence through influence vectors and matrices, FedC^2I allows clients to selectively acquire knowledge from similar peers and guides the aggregation of feature representations and classifiers. Experiments under non-IID settings show that FedC^2I outperforms existing federated learning methods in effectiveness, robustness, and interpretability.

arXiv Machine Learning
Sep 3

Similarity-Aware Personalized Federated Learning in Heterogeneous Environments

The paper introduces SAPE-FL, a personalization framework for Federated Learning that anchors each client’s model to both a global model and a similarity-weighted peer-averaged model. By applying dynamic, client-specific regularization based on model and output similarity, SAPE-FL balances global knowledge transfer with peer collaboration, filtering out dissimilar clients. The authors provide theoretical convergence guarantees and demonstrate empirically that SAPE-FL outperforms state‑of‑the‑art methods in highly heterogeneous and low‑data scenarios.

By Arun Kumar A V, Sunil Gupta, Dang Ngyuen, Bao Duong, Dat Phan Trong
Hugging Face Trending Papers
Aug 10

FedTVD: Balancing Data Quality and Quantity for Robust Federated Learning

Federated Learning (FL) enables collaborative model training across distributed client devices while preserving data privacy. However, FL faces significant challenges due to data heterogeneity, particularly in terms of label distribution skewness and variations in dataset sizes, which can lead to biased model updates and hinder convergence.

arXiv Machine Learning
Oct 3

Latent Information Sharing for Accelerating Federated Learning

The paper introduces a latent information sharing scheme for federated learning that mitigates client drift by sharing a small amount of hidden‑layer activations. The authors demonstrate both theoretically and empirically that this approach improves training efficiency while maintaining convergence guarantees and data privacy. Compared to existing methods such as FedProx, SCAFFOLD, FedPVR, FedProto, and SplitFed, the proposed method achieves higher model accuracy within a fixed round budget without adding significant communication overhead.

By Seungjun Lee, Ensieh Khazaei, Dimitrios Hatzinakos, Baturalp Buyukates, Sunwoo Lee
arXiv Machine Learning
Aug 31

Beyond Non-IID: Learner--Client Distribution Mismatch in Federated Learning

The paper addresses the mismatch between learner and client data distributions in federated learning, noting that traditional client selection methods often ignore this misalignment. It introduces a dynamic, influence-aware client selection framework that uses a small proxy dataset to estimate each client's utility for the learner’s objective, prioritizing informative sources while mitigating noise and heterogeneity. Experiments on CIFAR-10 with heterogeneous partitions show the proposed method outperforms static and dynamic baselines, achieving faster convergence and higher accuracy.

By Yiming Xie, Lili Su, Ningfang Mi