FedRG: Unleashing the Representation Geometry for Federated Learning with Noisy Clients
Authors: Tian Wen, Zhiqin Yang, Yonggang Zhang, Xuefeng Jiang, Hao Peng, Yuwei Wang, Bo Han
Organizations: Institute of Computing Technology, Chinese Academy of Sciences · TMLR Group, Hong Kong Baptist University · The Hong Kong University of Science and Technology · Beihang University
Federated learning (FL) suffers from performance degradation due to the inevitable presence of noisy annotations in distributed scenarios. Existing approaches have advanced in distinguishing noisy samples from the dataset for label correction by leveraging loss values. However, noisy samples recognition relying on scalar loss lacks reliability for FL under heterogeneous scenarios. In this paper, we rethink this paradigm from a representation perspective and propose \method~(Federated under Representation Gemometry), which follows the principle of ``representation geometry priority'' to recognize noisy labels. Firstly, \methodcreates label-agnostic spherical representations by using self-supervision. It then iteratively fits a spherical von Mises-Fisher (vMF) mixture model to this geometry using previously identified clean samples to capture semantic clusters. This geometric evidence is integrated with a semantic-label soft mapping mechanism to derive a distribution divergence between the label-free and annotated label-conditioned feature space, which robustly identifies noisy samples and updates the vMF mixture model with the newly separated clean dataset. Lastly, we employ an additional personalized noise absorption matrix on noisy labels to achieve robust optimization. Extensive experimental results demonstrate that \methodsignificantly outperforms state-of-the-art methods for FL with data heterogeneity under diverse noisy clients scenarios.
Figures & tables
Figure 1: Comparison of noise identification performance between the existing method and FedRG under severe data heterogeneity. The existing methods mainly identify based on the distribution of scalar loss values. In heterogeneous scenarios, the loss value alone becomes unreliable, while FedRG provides more robust spatial geometry to filter out noise samples. Higher FN (False Negatives) but lower TP (True Positives) indicate that noise identification based on loss value wrongly classifies many correct labels as noise labels. The red circle denotes that the noisy samples we want to identify based on the geometric evidence.
Figure 2: Overview of FedRG. The label decoupled spherical representation stage gets the hypersphere of samples. Then, we follow the representation geometry priority principle to split the clean and noisy samples based on the distribution divergence in the vMF distribution. The pseudocode overview of FedRG is provided in Appendix Sec.2
Figure 3: Comparison of the performance among different schemes under four heterogeneous noise scenarios on CIFAR10. Each radar chart corresponds to a specific type of label noise: (a) symmetric with localized noise, (b) symmetric with globalized noise, (c) pairflip with localized noise, and (d) pairflip with globalized noise.
Figure 4: Comparison of model performance under different numbers of selected clients and semantic clusters.
Federated learning (FL) enables collaborative model training without sharing raw data; however, the presence of noisy labels across distributed clients can severely degrade the learning performance. In this paper, we propose FedSIR, a multi-stage framework for robust FL under noisy labels. Different from existing approaches that mainly rely on designing noise-tolerant loss functions or exploiting loss dynamics during training, our method leverages the spectral structure of client feature representations to identify and mitigate label noise. Our framework consists of three key components. First, we identify clean and noisy clients by analyzing the spectral consistency of class-wise feature subspaces with minimal communication overhead. Second, clean clients provide spectral references that enable noisy clients to relabel potentially corrupted samples using both dominant class directions and residual subspaces. Third, we employ a noise-aware training strategy that integrates logit-adjusted loss, knowledge distillation, and distance-aware aggregation to further stabilize federated optimization. Extensive experiments on standard FL benchmarks demonstrate that FedSIR consistently outperforms state-of-the-art methods for FL with noisy labels. The code is available at https://github.com/sinagh72/FedSIR.
Sina Gholami, Abdulmoneam Ali, Tania Haghighi +2
University of North Carolina at Charlotte Charlotte, NC, USA
Noisy labels in distributed datasets induce severe local overfitting and consequently compromise the global model in federated learning (FL). Most existing solutions rely on selecting clean devices or aligning with public clean datasets, rather than endowing the model itself with robustness. In this paper, we propose FedCova, a dependency-free federated covariance learning framework that eliminates such external reliances by enhancing the model's intrinsic robustness via a new perspective on feature covariances. Specifically, FedCova encodes data into a discriminative but resilient feature space to tolerate label noise. Built on mutual information maximization, we design a novel objective for federated lossy feature encoding that relies solely on class feature covariances with an error tolerance term. Leveraging feature subspaces characterized by covariances, we construct a subspace-augmented federated classifier. FedCova unifies three key processes through the covariance: (1) training the network for feature encoding, (2) constructing a classifier directly from the learned features, and (3) correcting noisy labels based on feature subspaces. We implement FedCova across both symmetric and asymmetric noisy settings under heterogeneous data distribution. Experimental results on CIFAR-10/100 and real-world noisy dataset Clothing1M demonstrate the superior robustness of FedCova compared with the state-of-the-art methods.
Department of Information Engineering, The Chinese University of Hong Kong · National Key Laboratory on Wireless Communications, University of Electronic Science and Technology of China
Personalized Federated Learning (PFL) aims to learn multiple task-specific models rather than a single global model across heterogeneous data distributions. Existing PFL approaches typically rely on iterative optimization-such as model update trajectories-to cluster users that need to accomplish the same tasks together. However, these learning-dynamics-based methods are inherently vulnerable to low-quality data and noisy labels, as corrupted updates distort clustering decisions and degrade personalization performance. To tackle this, we propose FB-NLL, a feature-centric framework that decouples user clustering from iterative training dynamics. By exploiting the intrinsic heterogeneity of local feature spaces, FB-NLL characterizes each user through the spectral structure of the covariances of their feature representations and leverages subspace similarity to identify task-consistent user groupings. This geometry-aware clustering is label-agnostic and is performed in a one-shot manner prior to training, significantly reducing communication overhead and computational costs compared to iterative baselines. Complementing this, we introduce a feature-consistency-based detection and correction strategy to address noisy labels within clusters. By leveraging directional alignment in the learned feature space and assigning labels based on class-specific feature subspaces, our method mitigates corrupted supervision without requiring estimation of stochastic noise transition matrices. In addition, FB-NLL is model-independent and integrates seamlessly with existing noise-robust training techniques. Extensive experiments across diverse datasets and noise regimes demonstrate that our framework consistently outperforms state-of-the-art baselines in terms of average accuracy and performance stability.
Abdulmoneam Ali, Ahmed Arafa
Department of Electrical and Computer Engineering, University of North Carolina at Charlotte, NC 28223, USA