Pith. sign in

REVIEW 1 cited by

Improving Data Quality with Training Dynamics of Gradient Boosting Decision Trees

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 2210.11327 v2 pith:3USWZBGB submitted 2022-10-20 cs.LG stat.ML

classification cs.LGstat.ML
keywords datasetsboostingdatadecisionmetricstrainingtreescontribution
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Real world datasets contain incorrectly labeled instances that hamper the performance of the model and, in particular, the ability to generalize out of distribution. Also, each example might have different contribution towards learning. This motivates studies to better understanding of the role of data instances with respect to their contribution in good metrics in models. In this paper we propose a method based on metrics computed from training dynamics of Gradient Boosting Decision Trees (GBDTs) to assess the behavior of each training example. We focus on datasets containing mostly tabular or structured data, for which the use of Decision Trees ensembles are still the state-of-the-art in terms of performance. Our methods achieved the best results overall when compared with confident learning, direct heuristics and a robust boosting algorithm. We show results on detecting noisy labels in order clean datasets, improving models' metrics in synthetic and real public datasets, as well as on a industry case in which we deployed a model based on the proposed solution.

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. Selfish Evolution: Making Discoveries in Extreme Label Noise with the Help of Overfitting Dynamics

    cs.CV 2024-11 conditional novelty 6.0 of 10

    Selfish Evolution detects and corrects corrupted labels by training a secondary network on the temporal evolution of a primary network overfitting to individual samples.

Pith tools