Client-Conditional Federated Learning via Local Training Data Statistics

📅 2026-03-11
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the performance degradation of federated learning under data heterogeneity—including label shift, covariate shift, and concept shift—as well as in data-scarce settings. The authors propose a communication-free personalization method that dynamically conditions a single global model by embedding client-specific PCA statistics, computed locally, as continuous conditional inputs. Trained within the standard federated learning framework, the approach incurs no additional communication overhead. Extensive experiments demonstrate that the method consistently outperforms existing approaches across 97 configurations, surpassing even an oracle baseline with access to true cluster assignments by 1–6% under complex heterogeneity, while maintaining robust performance under data sparsity—where it remains the only method exhibiting consistent stability.

Technology Category

Machine Learning: PrivacySearch and Optimization: Learning to SearchNatural Language Processing: Learning & Optimization for NLP

Application Category

User Modeling, Personalization and Recommendation: Federated recommendation systems and personalizationSearch and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for rankingWeb Mining and Content Analysis: Large pretrained models with web data
📝 Abstract
Federated learning (FL) under data heterogeneity remains challenging: existing methods either ignore client differences (FedAvg), require costly cluster discovery (IFCA), or maintain per-client models (Ditto). All degrade when data is sparse or heterogeneity is multi-dimensional. We propose conditioning a single global model on locally-computed PCA statistics of each client's training data, requiring zero additional communication. Evaluating across 97~configurations spanning four heterogeneity types (label shift, covariate shift, concept shift, and combined heterogeneity), four datasets (MNIST, Fashion-MNIST, CIFAR-10, CIFAR-100), and seven FL baseline methods, we find that our method matches the Oracle baseline -- which knows true cluster assignments -- across all settings, surpasses it by 1--6% on combined heterogeneity where continuous statistics are richer than discrete cluster identifiers, and is uniquely sparsity-robust among all tested methods.
Problem

Research questions and friction points this paper is trying to address.

federated learning
data heterogeneity
client differences
data sparsity
multi-dimensional heterogeneity
Innovation

Methods, ideas, or system contributions that make the work stand out.

Federated Learning
Data Heterogeneity
PCA Statistics
Client-Conditional Modeling
Sparsity Robustness
🔎 Similar Papers
No similar papers found.
R
Rickard Brännvall
RISE Research Institutes of Sweden