Experimental results demonstrate that the proposed <inline-formula> <tex-math notation="LaTeX">$FedG^{2}$ </tex-math></inline-formula> outperforms widely-used baselines and achieves good performance on various heterogeneous settings.
Abstract
Federated learning (FL) has become the mainstream framework for training models on geographically dispersed edge devices. Owing to differences in sample availability and distribution, the quality of local data can vary substantially across clients. Many studies have proposed evaluating the contribution of clients’ local data using metrics such as local data proportion, local training loss, and gradient direction. However, they ignore a key training dynamics: scattered generalization gap. Some clients can fit to local minima quickly due to too poor sample quality or vast local training epochs while others being far from optima, leading to sub-optimal accuracy. In this paper, we focus on the generalization behaviour of clients during runtime, and propose the <inline-formula> <tex-math notation="LaTeX">$FedG^{2}$ </tex-math></inline-formula> algorithm. The <inline-formula> <tex-math notation="LaTeX">$FedG^{2}$ </tex-math></inline-formula> defines the utility dynamics of models with generalization gap and utilizes it to measure the marginal contribution of each client dynamically in each round. In addition, <inline-formula> <tex-math notation="LaTeX">$FedG^{2}$ </tex-math></inline-formula> incorporates the local update magnitudes into account to make updates more consistent with global objective. Experimental results demonstrate that <inline-formula> <tex-math notation="LaTeX">$FedG^{2}$ </tex-math></inline-formula> outperforms widely-used baselines and achieves good performance on various heterogeneous settings.
Local Inference Guided Aggregation for Heterogeneous Training Environments to Yield Enhancement Through Agreement and Regularization (LIGHTYEAR), a federated learning framework that performs update selection in function space using an NTK-based agreement score to characterize predictive behavior and determine a persona...
Mirko Konstantin, S. Zachow, Anirban Mukhopadhyay· 0 citations
Cross-silo federated reinforcement learning (FRL) trains a shared policy across silos that must simultaneously respect a per-round uplink budget and on-device privacy. Although differential privacy (DP) and gradient compression each have mature solutions in supervised federated learning, naively stacking them in the po...
Jian-Tao Xu· IEEE Transactions on Communi...· 0 citations
This work proposes a data-Quality-aware aggregation framework by introducing an Evolutionary-computation-inspired de-sign into Federated learning ( FedEvoQ), with a lightweight dual-branch architecture.
Le-Ming Wu, Yao-Chu Jin, Han Yu et al.· Proceedings of the Thirty-Fi...· 0 citations
This paper considers the practical setting where the learner keeps a small proxy dataset, and proposes a dynamic, influence-aware client selection framework that estimates each client's potential utility to the learner's optimization objective using proxy influence signals on a learner-specific proxy set.
Yi-Ming Xie, Linghui Su, Ning-Fang Mi· 0 citations
Federated Learning (FL) enables collaborative model training across distributed clients while keeping their original data within local environments, thereby reducing the need for centralized data collection. Despite this advantage, the effectiveness of FL strongly depends on model aggregation, which determines how loca...
Anil Wanare, Ir.Dr. Pankaj Agarka, Hemant A. Wani et al.· Adolescência e Saúde· 0 citations
This work first design the kernel matrices of DPPs using gradient information and quality scores, which inherently enables a flexible quality-diversity trade-off, and proposes Adaptive Determinantal Client Scheduling (ADCS) in FL.
Wen Xu, Ben Liang, G. Boudreau et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.