Pith. sign in

REVIEW 1 cited by

Instance Correction for Learning with Open-set Noisy Labels

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.00455 v1 pith:HS5YBPOQ submitted 2021-06-01 cs.LG

classification cs.LG
keywords datalabelsnoisycorrectiondiscardedopen-settraininginstance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The problem of open-set noisy labels denotes that part of training data have a different label space that does not contain the true class. Lots of approaches, e.g., loss correction and label correction, cannot handle such open-set noisy labels well, since they need training data and test data to share the same label space, which does not hold for learning with open-set noisy labels. The state-of-the-art methods thus employ the sample selection approach to handle open-set noisy labels, which tries to select clean data from noisy data for network parameters updates. The discarded data are seen to be mislabeled and do not participate in training. Such an approach is intuitive and reasonable at first glance. However, a natural question could be raised "can such data only be discarded during training?". In this paper, we show that the answer is no. Specifically, we discuss that the instances of discarded data could consist of some meaningful information for generalization. For this reason, we do not abandon such data, but use instance correction to modify the instances of the discarded data, which makes the predictions for the discarded data consistent with given labels. Instance correction are performed by targeted adversarial attacks. The corrected data are then exploited for training to help generalization. In addition to the analytical results, a series of empirical evidences are provided to justify our claims.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty

    cs.LG 2025-02 conditional novelty 6.0 of 10

    A lightweight score combining prediction mean and variance, plus ratio-adaptive Beta sampling, prunes datasets early in training and reaches 60% ImageNet accuracy at 90% pruning.

Pith tools