ANNE: Adaptive Nearest Neighbors and Eigenvector-based Sample Selection for Robust Learning with Noisy Labels
Filipe R. Cordeiro, Gustavo Carneiro

TL;DR
This paper introduces ANNE, a novel sample selection method combining loss-based and feature-based approaches to improve noisy-label learning across various noise scenarios, demonstrating superior accuracy over existing methods.
Contribution
ANNE innovatively integrates loss-based sampling with FINE and Adaptive KNN, enhancing robustness and performance in noisy-label learning across diverse noise conditions.
Findings
ANNE outperforms SOTA methods in accuracy on multiple datasets.
ANNE maintains competitive training times.
ANNE is effective across different noise types and levels.
Abstract
An important stage of most state-of-the-art (SOTA) noisy-label learning methods consists of a sample selection procedure that classifies samples from the noisy-label training set into noisy-label or clean-label subsets. The process of sample selection typically consists of one of the two approaches: loss-based sampling, where high-loss samples are considered to have noisy labels, or feature-based sampling, where samples from the same class tend to cluster together in the feature space and noisy-label samples are identified as anomalies within those clusters. Empirically, loss-based sampling is robust to a wide range of noise rates, while feature-based sampling tends to work effectively in particular scenarios, e.g., the filtering of noisy instances via their eigenvectors (FINE) sampling exhibits greater robustness in scenarios with low noise rates, and the K nearest neighbor (KNN)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition
MethodsSparse Evolutionary Training
