Pith. sign in

REVIEW

Inconsistency Ranking-based Noisy Label Detection for High-quality Data

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 2212.00239 v2 pith:OANUFODD submitted 2022-12-01 cs.CL cs.SDeess.AS

classification cs.CLcs.SDeess.AS
keywords datahigh-qualityinconsistencynoisyautomaticcleaningdatasetsdetection
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The success of deep learning requires high-quality annotated and massive data. However, the size and the quality of a dataset are usually a trade-off in practice, as data collection and cleaning are expensive and time-consuming. In real-world applications, especially those using crowdsourcing datasets, it is important to exclude noisy labels. To address this, this paper proposes an automatic noisy label detection (NLD) technique with inconsistency ranking for high-quality data. We apply this technique to the automatic speaker verification (ASV) task as a proof of concept. We investigate both inter-class and intra-class inconsistency ranking and compare several metric learning loss functions under different noise settings. Experimental results confirm that the proposed solution could increase both the efficient and effective cleaning of large-scale speaker recognition datasets.

Discussion (0). Continue with ORCID to comment.

Pith tools