Pith. sign in

REVIEW 1 cited by

Exponentiated Gradient Reweighting for Robust Training Under Label Noise and Beyond

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 2104.01493 v1 pith:C77URWEJ submitted 2021-04-03 cs.LG stat.ML

classification cs.LGstat.ML
keywords exampleslearninggradientnoisyapproachlossnoisetraining
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many learning tasks in machine learning can be viewed as taking a gradient step towards minimizing the average loss of a batch of examples in each training iteration. When noise is prevalent in the data, this uniform treatment of examples can lead to overfitting to noisy examples with larger loss values and result in poor generalization. Inspired by the expert setting in on-line learning, we present a flexible approach to learning from noisy examples. Specifically, we treat each training example as an expert and maintain a distribution over all examples. We alternate between updating the parameters of the model using gradient descent and updating the example weights using the exponentiated gradient update. Unlike other related methods, our approach handles a general class of loss functions and can be applied to a wide range of noise types and applications. We show the efficacy of our approach for multiple learning settings, namely noisy principal component analysis and a variety of noisy classification problems.

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. Mirror Descent Using the Tempesta Generalized Multi-parametric Logarithms

    stat.ML 2025-06 conditional novelty 4.0 of 10

    The authors derive mirror descent and mirror-less updates using the Tempesta generalized logarithm as the link function, with an approximate inverse exponential obtained via Lagrange inversion.

Pith tools