Pith. sign in

REVIEW 1 cited by

A Gradient-based Approach for Online Robust Deep Neural Network Training with 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 2306.05046 v1 pith:JABWYHEF submitted 2023-06-08 cs.LG

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

Learning with noisy labels is an important topic for scalable training in many real-world scenarios. However, few previous research considers this problem in the online setting, where the arrival of data is streaming. In this paper, we propose a novel gradient-based approach to enable the detection of noisy labels for the online learning of model parameters, named Online Gradient-based Robust Selection (OGRS). In contrast to the previous sample selection approach for the offline training that requires the estimation of a clean ratio of the dataset before each epoch of training, OGRS can automatically select clean samples by steps of gradient update from datasets with varying clean ratios without changing the parameter setting. During the training process, the OGRS method selects clean samples at each iteration and feeds the selected sample to incrementally update the model parameters. We provide a detailed theoretical analysis to demonstrate data selection process is converging to the low-loss region of the sample space, by introducing and proving the sub-linear local Lagrangian regret of the non-convex constrained optimization problem. Experimental results show that it outperforms state-of-the-art methods in different settings.

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. CAdam: Confidence-Based Optimization for Online Learning

    cs.LG 2024-11 conditional novelty 5.0 of 10

    CAdam masks Adam updates when momentum and gradient disagree in sign, improving robustness to distribution shift and label noise while preserving Adam's convergence rate.

Pith tools