Pith. sign in

REVIEW 1 cited by

Retraining with Predicted Hard Labels Provably Increases Model Accuracy

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 2406.11206 v3 pith:LDJS3UEA submitted 2024-06-17 cs.LG cs.CRstat.ML

classification cs.LGcs.CRstat.ML
keywords retraininglabelslabeltrainingaccuracygivenmodelnoisy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The performance of a model trained with noisy labels is often improved by simply \textit{retraining} the model with its \textit{own predicted hard labels} (i.e., 1/0 labels). Yet, a detailed theoretical characterization of this phenomenon is lacking. In this paper, we theoretically analyze retraining in a linearly separable binary classification setting with randomly corrupted labels given to us and prove that retraining can improve the population accuracy obtained by initially training with the given (noisy) labels. To the best of our knowledge, this is the first such theoretical result. Retraining finds application in improving training with local label differential privacy (DP) which involves training with noisy labels. We empirically show that retraining selectively on the samples for which the predicted label matches the given label significantly improves label DP training at no extra privacy cost; we call this consensus-based retraining. As an example, when training ResNet-18 on CIFAR-100 with $\epsilon=3$ label DP, we obtain more than 6% improvement in accuracy with consensus-based retraining.

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. Self-Boost via Optimal Retraining: An Analysis via Approximate Message Passing

    cs.LG 2025-05 conditional novelty 6.0 of 10

    For binary classification with noisy labels, the paper derives the Bayes-optimal function for combining a model's current predictions with the given labels during retraining, and shows a fitted version improves linear...

Pith tools