Federated learning (FL) is a promising paradigm of machine learning, which preserves user privacy by enabling learning without sharing raw data with a cloud server. Straggling clients have been a prob...
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
arXiv:2609.39250v1 Announce Type: new
Abstract: Federated learning (FL) is a promising paradigm of machine learning, which preserves user privacy by enabling learning without sharing raw data with a...
By Muzaffer Citir, Hiroki Nishikawa, Sangyoung Park
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:2605. 11165v3 Announce Type: replace Abstract: Federated learning (FL) in heterogeneous environments remains challenging because client models often differ in both architecture and data distribution.
By Ben Rachmut, Luise Ge, William Yeoh, Ning Zhang, Yevgeniy Vorobeychik
arXiv:2601. 09304v2 Announce Type: replace Abstract: Federated Learning (FL) enables distributed learning across multiple clients without sharing raw data.
By Sota Sugawara, Yuji Kawamata, Akihiro Toyoda, Tomoru Nakayama, Yukihiko Okada
arXiv:2606. 26037v1 Announce Type: cross Abstract: Federated learning has emerged as the foremost approach for decentralized model training with privacy preservation.
By Guangzheng Hu, Patricia Men\'endez, Feng Liu, Mingming Gong, Guanghui Wang, Liuhua Peng
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.
By Yue Tan, Guodong Long, Jing Jiang, Chengqi Zhang
arXiv:2608. 02250v1 Announce Type: new Abstract: Federated learning (FL) is a popular distributed learning framework where multiple clients perform local training and a server aggregates the locally updated models.
By Yuan-Heng Tsai, Li-Hsing Yen, Yan-Wei Chen
arXiv:2606. 30499v1 Announce Type: new Abstract: Federated Learning often suffers under non-independently and identically distributed data, where a single global model may fail to represent the diversity of client distributions.
By Davide Domini, Gianluca Aguzzi, Ivana Dusparic, Danilo Pianini, Mirko Viroli
arXiv:2606. 30161v1 Announce Type: cross Abstract: Federated learning typically aggregates client updates using fixed or heuristic weighting rules, which can be suboptimal when clients have heterogeneous data and varying contributions to the global model.
By Dario Fenoglio, Daniil Kirilenko, Martin Gjoreski, Marc Langheinrich
StoCFL is a clustered federated learning framework designed to address Non-IID data and dynamic client participation. It introduces a flexible clustering mechanism that allows arbitrary client participation and accommodates newly joined clients, improving data efficiency and model performance. Experiments on four Non-IID settings and a real-world dataset demonstrate that StoCFL achieves promising cluster results even when the number of clusters is unknown, outperforming baseline approaches across various scenarios.
By Dun Zeng, Xiangjing Hu, Shiyu Liu, Yue Yu, Qifan Wang, Zenglin Xu