A Survey of Label-noise Representation Learning: Past, Present and Future
read the original abstract
Classical machine learning implicitly assumes that labels of the training data are sampled from a clean distribution, which can be too restrictive for real-world scenarios. However, statistical-learning-based methods may not train deep learning models robustly with these noisy labels. Therefore, it is urgent to design Label-Noise Representation Learning (LNRL) methods for robustly training deep models with noisy labels. To fully understand LNRL, we conduct a survey study. We first clarify a formal definition for LNRL from the perspective of machine learning. Then, via the lens of learning theory and empirical study, we figure out why noisy labels affect deep models' performance. Based on the theoretical guidance, we categorize different LNRL methods into three directions. Under this unified taxonomy, we provide a thorough discussion of the pros and cons of different categories. More importantly, we summarize the essential components of robust LNRL, which can spark new directions. Lastly, we propose possible research directions within LNRL, such as new datasets, instance-dependent LNRL, and adversarial LNRL. We also envision potential directions beyond LNRL, such as learning with feature-noise, preference-noise, domain-noise, similarity-noise, graph-noise and demonstration-noise.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Safe-Subspace Pseudo-Label Refinement for Source-Free Graph Domain Adaptation
S²PLR identifies a safe subspace for reliable pseudo-labels in source-free graph domain adaptation using semantic committee signals and structural contrastive verification, then applies noise-tolerant regularization t...
-
Intelligence Inertia: Physical Isomorphism and Applications
Intelligence Inertia models the computational resistance to structural change in neural networks via a heuristic relativistic analogy, yielding a J-shaped cost curve that diverges from classical approximations.
-
Universal hidden monotonic trend estimation with contrastive learning
The paper proposes contrastive trend estimation (CTE) as a universal method for identifying hidden monotonic trends in any type of temporal data without standard assumptions.
-
An Adaptive Data cleaning Framework for Noisy Label Detection
A self-adaptive framework maps image samples to a low-dimensional multi-metric space and applies clustering to separate clean and noisy labels, reporting high recall on CIFAR-10, MNIST, and ImageNet-100 under 5-40% sy...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.