mlsanityData to 7 Oct 2026

FB-NLL: A Feature-Based Approach to Tackle Noisy Labels in Personalized Federated Learning

arXiv 2604.19729 ↗First posted 21 Apr 2026cs.LG cs.IT eess.SPcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 26 of its 37 references that are in the map. First posted on arXiv 21 Apr 2026.

Builds on

26 of 37 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  3. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
  4. 2020Ensemble Distillation for Robust Model Fusion in Federated Learningcited by 678
  5. 2017Federated Multi-Task Learningcited by 669
  6. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
  7. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
  8. 2020An Efficient Framework for Clustered Federated Learningcited by 505
  9. 2019Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraintscited by 499
  10. 2021Towards Personalized Federated Learningcited by 462
  11. 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 414
  12. 2017Deep Learning is Robust to Massive Label Noisecited by 164
14 more
  1. 2021FINE Samples for Learning with Noisy Labelscited by 82
  2. 2021Learning Noise Transition Matrix from Only Noisy Labels via Total Variation Regularizationcited by 62
  3. 2022FedCorr: Multi-Stage Federated Learning for Label Noise Correctioncited by 61
  4. 2020Robust Federated Learning with Noisy Labelscited by 40
  5. 2022Mitigating Memorization of Noisy Labels by Clipping the Model Predictioncited by 40
  6. 2023FedNoRo: Towards Noise-Robust Federated Learning by Addressing Class Imbalance and Label Noise Heterogeneitycited by 33
  7. 2022Towards Federated Learning against Noisy Labels via Local Self-Regularizationcited by 26
  8. 2022Fundamentals of Task-Agnostic Data Valuationcited by 19
  9. 2022CTRL: Clustering Training Losses for Label Error Detectioncited by 17
  10. 2023FedDiv: Collaborative Noise Filtering for Federated Learning with Noisy Labelscited by 13
  11. 2023Federated Learning with Extremely Noisy Clients via Negative Distillationcited by 12
  12. 2024Federated Learning Client Pruning for Noisy Labelscited by 4
  13. 2024Data Similarity-Based One-Shot Clustering for Multi-Task Hierarchical Federated Learningcited by 3
  14. 2025RCC-PFL: Robust Client Clustering under Noisy Labels in Personalized Federated Learningcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.