LaplaceConfidence: a Graph-based Approach for Learning with Noisy Labels
Mingcai Chen, Yuntao Du, Wei Tang, Baoming Zhang, Hao Cheng, Shuwei, Qian, Chongjun Wang

TL;DR
LaplaceConfidence is a graph-based method that leverages the Laplacian energy to estimate label confidence in noisy datasets, improving robust training by effectively identifying clean labels.
Contribution
It introduces a novel graph-based approach using Laplacian energy for label confidence estimation, integrating co-training and label refurbishment for robust learning with noisy labels.
Findings
Outperforms state-of-the-art methods on benchmark datasets
Effective in both synthetic and real-world noisy conditions
Utilizes graph construction and Laplacian energy for label confidence estimation
Abstract
In real-world applications, perfect labels are rarely available, making it challenging to develop robust machine learning algorithms that can handle noisy labels. Recent methods have focused on filtering noise based on the discrepancy between model predictions and given noisy labels, assuming that samples with small classification losses are clean. This work takes a different approach by leveraging the consistency between the learned model and the entire noisy dataset using the rich representational and topological information in the data. We introduce LaplaceConfidence, a method that to obtain label confidence (i.e., clean probabilities) utilizing the Laplacian energy. Specifically, it first constructs graphs based on the feature representations of all noisy samples and minimizes the Laplacian energy to produce a low-energy graph. Clean labels should fit well into the low-energy graph…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Data Classification
