mlsanityData to 14 Oct 2026

Deconstructing the Failure of Ideal Noise Correction: A Three-Pillar Diagnosis

arXiv 2603.12997 ↗First posted 13 Mar 2026cs.LG cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Statistically consistent methods based on the noise transition matrix (T) offer a theoretically grounded solution to Learning with Noisy Labels (LNL), with guarantees of convergence to the optimal clean-data classifier. In practice, however, these methods are often outperformed by empirical approaches such as sample selection, and this gap is usually attributed to the difficulty of accurately estimating T. The common assumption is that, given a perfect T, noise-correction methods would recover their theoretical advantage. In this work, we put this longstanding hypothesis to a decisive test. We conduct experiments under idealized conditions, providing correction methods with a perfect, oracle transition matrix. Even under these ideal conditions, we observe that these methods still suffer from performance collapse during training. This compellingly demonstrates that the failure is not fundamentally a T-estimation problem, but stems from a more deeply rooted flaw. To explain this behaviour, we provide a unified analysis that links three levels: macroscopic convergence states, microscopic optimisation dynamics, and information-theoretic limits on what can be learned from noisy labels. Together, these results give a formal account of why ideal noise correction fails and offer concrete guidance for designing more reliable methods for learning with noisy labels.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 49 of its 68 references that are in the map. First posted on arXiv 13 Mar 2026.

Builds on

49 of 68 references.

References · 49

  1. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  2. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  3. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
  4. 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 997
  5. 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 692
  6. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 665
  7. 2019Symmetric Cross Entropy for Robust Learning with Noisy Labelscited by 500
  8. 2019How does Disagreement Help Generalization against Label Corruption?cited by 390
  9. 2019Unsupervised Label Noise Modeling and Loss Correctioncited by 328
  10. 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 219
  11. 2018Using Trusted Data to Train Deep Networks on Labels Corrupted by Severe Noisecited by 216
  12. 2019Probabilistic End-to-end Noise Correction for Learning with Noisy Labelscited by 210
37 more
  1. 2019Are Anchor Points Really Indispensable in Label-Noise Learning?cited by 208
  2. 2025FutureSightDrive: Thinking Visually with Spatio-Temporal CoT for Autonomous Drivingcited by 166
  3. 2020Dual T: Reducing Estimation Error for Transition Matrix in Label-noise Learningcited by 142
  4. 2022Selective-Supervised Contrastive Learning with Noisy Labelscited by 112
  5. 2021Provably End-to-end Label-Noise Learning without Anchor Pointscited by 97
  6. 2020Multi-Objective Interpolation Training for Robustness to Label Noisecited by 86
  7. 2021Augmentation Strategies for Learning with Noisy Labelscited by 86
  8. 2020Beyond Class-Conditional Assumption: A Primary Attempt to Combat Instance-Dependent Label Noisecited by 82
  9. 2020A Topological Filter for Learning with Label Noisecited by 76
  10. 2021Clusterability as an Alternative to Anchor Points When Learning with Noisy Labelscited by 65
  11. 2021NGC: A Unified Framework for Learning with Open-World Noisy Datacited by 58
  12. 2014Making Risk Minimization Tolerant to Label Noisecited by 54
  13. 2022Identifiability of Label Noise Transition Matrixcited by 34
  14. 2020Unbiased Risk Estimators Can Mislead: A Case Study of Learning with Complementary Labelscited by 29
  15. 2023A Conditional Denoising Diffusion Probabilistic Model for Point Cloud Upsamplingcited by 28
  16. 2024Arena Learning: Build Data Flywheel for LLMs Post-training via Simulated Chatbot Arenacited by 26
  17. 2025FedSWA: Improving Generalization in Federated Learning with Highly Heterogeneous Data via Momentum-Based Stochastic Controlled Weight Averagingcited by 25
  18. 2026Noisy but Valid: Robust Statistical Evaluation of LLMs with Imperfect Judgescited by 24
  19. 2024An End-to-End Robust Point Cloud Semantic Segmentation Network with Single-Step Conditional Diffusion Modelscited by 23
  20. 2023MaskCon: Masked Contrastive Learning for Coarse-Labelled Datasetcited by 21
  21. 2021PropMix: Hard Sample Filtering and Proportional MixUp for Learning with Noisy Labelscited by 17
  22. 2025AgentMath: Empowering Mathematical Reasoning for Large Language Models via Tool-Augmented Agentcited by 17
  23. 2024CLIPCleaner: Cleaning Noisy Labels with CLIPcited by 16
  24. 2025FedMuon: Accelerating Federated Learning with Matrix Orthogonalizationcited by 16
  25. 2024Size-invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detectioncited by 14
  26. 2022Adaptive Soft Contrastive Learningcited by 13
  27. 2024LAFS: Landmark-based Facial Self-supervised Learning for Face Recognitioncited by 13
  28. 2024PROSAC: Provably Safe Certification for Machine Learning Models under Adversarial Attackscited by 11
  29. 2024Regulating Model Reliance on Non-Robust Features by Smoothing Input Marginal Densitycited by 10
  30. 2025SeqGrowGraph: Learning Lane Topology as a Chain of Graph Expansionscited by 10
  31. 2024Deep learning-driven pulmonary artery and vein segmentation reveals demography-associated vasculature anatomical differencescited by 9
  32. 2024Improving Representation of High-frequency Components for Medical Visual Foundation Modelscited by 9
  33. 2025DP-FedPGN: Finding Global Flat Minima for Differentially Private Federated Learning via Penalizing Gradient Normcited by 9
  34. 2026FedNSAM:Consistency of Local and Global Flatness for Federated Learningcited by 7
  35. 2026FedBCD:Communication-Efficient Accelerated Block Coordinate Gradient Descent for Federated Learningcited by 7
  36. 2025Hybrid Generative Fusion for Efficient and Privacy-Preserving Face Recognition Dataset Generationcited by 5
  37. 2026Don't let the information slip awaycited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.