Abstract
Noise label learning has attracted considerable attention owing to its ability to leverage large amounts of inexpensive and imprecise data. Sharpness aware minimization (SAM) has shown effective improvements in the generalization performance in the presence of noisy labels by introducing adversarial weight perturbations in the model parameter space. However, our experimental observations have shown that the SAM generalization bottleneck primarily stems from the difficulty of finding the correct adversarial perturbation amidst the noisy data. To address this problem, a theoretical analysis of the mismatch in the direction of the parameter perturbation between noise and clean samples during the training process was conducted. Based on these analyses, a clean aware sharpness aware minimization algorithm known as CA-SAM is proposed. CA-SAM dynamically divides the training data into possible likely clean and noisy datasets based on the historical model output and uses likely clean samples to determine the direction of the parameter perturbation. By searching for flat minima in the loss landscape, the objective was to restrict the gradient perturbation direction of noisy samples to align them while preserving the clean samples. By conducting comprehensive experiments and scrutinizing benchmark datasets containing diverse noise patterns and levels, it is demonstrated that our CA-SAM outperforms certain innovative approaches by a substantial margin.