arXiv Machine Learning

Class-wise Contribution Estimation via Logit Maximization for Federated Learning

The paper introduces CELM, a data‑free framework for federated learning that estimates class‑wise contribution by maximizing logits. It constructs a cross‑client evidence matrix to quantify each client’s competence and coverage for each class, then uses this matrix to compute weighted aggregation that upweights clients offering strong evidence for underrepresented classes. The method maintains stability through simplex constraints and momentum smoothing, and it is compatible with standard FL pipelines, showing improved robustness to class imbalance and heterogeneity on vision benchmarks.

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
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
arXiv Machine Learning
Aug 20

Coordination on a Budget: Federated Active Learning with Few Labels

The paper introduces a federated active learning (FAL) approach that tackles data privacy and label scarcity by coordinating query selection across clients. In low-budget scenarios, it finds that homogeneous (IID) data actually requires stronger coordination to avoid redundant queries, while heterogeneous data naturally yields diversity—a reversal of the usual federated learning narrative. The authors propose a new framework that aligns client data in a shared embedding space via federated representation learning, enabling globally coordinated active selection while keeping annotations local, and demonstrate that this method outperforms existing FAL methods even with larger annotation budgets.

By Liam Mohr, Daphna Weinshall
arXiv AI
6d ago

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.

By Yue Tan, Guodong Long, Jing Jiang, Chengqi Zhang
arXiv AI
Aug 25

FedCC: Towards Addressing Label Distribution Skews in Distillation-Based Federated Learning

FedCC is a new algorithm for distillation-based federated learning that tackles label distribution skew by allowing clients to mark ambiguous samples as 'unknown' instead of forcing a potentially wrong classification. By adding this extra class and calibrating pseudo-labels on a public dataset, FedCC balances confidence across majority and minority classes. Experiments show that FedCC outperforms existing methods, achieving 67.3% accuracy even when each client has data from only one of ten classes, whereas baselines drop to near-random performance.

By Wenxuan Ye, Onur Ayan, Xueli An, Georg Carle