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

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 datase...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yuan, Ruibin, Yin, Hanzhi, Wang, Yi, He, Yifan, Ye, Yushi, Zhang, Lei, Wu, Zhizheng
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Yuan, Ruibin
Yin, Hanzhi
Wang, Yi
He, Yifan
Ye, Yushi
Zhang, Lei
Wu, Zhizheng
description 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.
doi_str_mv 10.48550/arxiv.2212.00239
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2212_00239</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2212_00239</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-89f9257375fb2405a30edcda5c73098b40534f1e1a325a8dba1df7e0d36f9fea3</originalsourceid><addsrcrecordid>eNotz71OwzAYhWEvDKhwAUz4Bhz8E9fxiFpoK0Ugoe7RZ_tzazU4EAdE7h4oTEd6hyM9hNwIXtWN1vwOxq_0WUkpZMW5VPaSbHbZD7mkMmH2M32BfEr5wBwUDPRpSGWmLTjs6Ron9FMaMo3DSLfpcGTvH9CnaaZrmOCKXEToC17_74LsHx_2qy1rnze71X3LYGksa2y0UhtldHSy5hoUx-ADaG8Ut437SaqOAgUoqaEJDkSIBnlQy2gjglqQ27_bs6R7G9MrjHP3K-rOIvUNMd9GYw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Inconsistency Ranking-based Noisy Label Detection for High-quality Data</title><source>arXiv.org</source><creator>Yuan, Ruibin ; Yin, Hanzhi ; Wang, Yi ; He, Yifan ; Ye, Yushi ; Zhang, Lei ; Wu, Zhizheng</creator><creatorcontrib>Yuan, Ruibin ; Yin, Hanzhi ; Wang, Yi ; He, Yifan ; Ye, Yushi ; Zhang, Lei ; Wu, Zhizheng</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.2212.00239</identifier><language>eng</language><subject>Computer Science - Computation and Language ; Computer Science - Sound</subject><creationdate>2022-11</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2212.00239$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2212.00239$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Yuan, Ruibin</creatorcontrib><creatorcontrib>Yin, Hanzhi</creatorcontrib><creatorcontrib>Wang, Yi</creatorcontrib><creatorcontrib>He, Yifan</creatorcontrib><creatorcontrib>Ye, Yushi</creatorcontrib><creatorcontrib>Zhang, Lei</creatorcontrib><creatorcontrib>Wu, Zhizheng</creatorcontrib><title>Inconsistency Ranking-based Noisy Label Detection for High-quality Data</title><description>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.</description><subject>Computer Science - Computation and Language</subject><subject>Computer Science - Sound</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAYhWEvDKhwAUz4Bhz8E9fxiFpoK0Ugoe7RZ_tzazU4EAdE7h4oTEd6hyM9hNwIXtWN1vwOxq_0WUkpZMW5VPaSbHbZD7mkMmH2M32BfEr5wBwUDPRpSGWmLTjs6Ron9FMaMo3DSLfpcGTvH9CnaaZrmOCKXEToC17_74LsHx_2qy1rnze71X3LYGksa2y0UhtldHSy5hoUx-ADaG8Ut437SaqOAgUoqaEJDkSIBnlQy2gjglqQ27_bs6R7G9MrjHP3K-rOIvUNMd9GYw</recordid><startdate>20221130</startdate><enddate>20221130</enddate><creator>Yuan, Ruibin</creator><creator>Yin, Hanzhi</creator><creator>Wang, Yi</creator><creator>He, Yifan</creator><creator>Ye, Yushi</creator><creator>Zhang, Lei</creator><creator>Wu, Zhizheng</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20221130</creationdate><title>Inconsistency Ranking-based Noisy Label Detection for High-quality Data</title><author>Yuan, Ruibin ; Yin, Hanzhi ; Wang, Yi ; He, Yifan ; Ye, Yushi ; Zhang, Lei ; Wu, Zhizheng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-89f9257375fb2405a30edcda5c73098b40534f1e1a325a8dba1df7e0d36f9fea3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Computation and Language</topic><topic>Computer Science - Sound</topic><toplevel>online_resources</toplevel><creatorcontrib>Yuan, Ruibin</creatorcontrib><creatorcontrib>Yin, Hanzhi</creatorcontrib><creatorcontrib>Wang, Yi</creatorcontrib><creatorcontrib>He, Yifan</creatorcontrib><creatorcontrib>Ye, Yushi</creatorcontrib><creatorcontrib>Zhang, Lei</creatorcontrib><creatorcontrib>Wu, Zhizheng</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yuan, Ruibin</au><au>Yin, Hanzhi</au><au>Wang, Yi</au><au>He, Yifan</au><au>Ye, Yushi</au><au>Zhang, Lei</au><au>Wu, Zhizheng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Inconsistency Ranking-based Noisy Label Detection for High-quality Data</atitle><date>2022-11-30</date><risdate>2022</risdate><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.</abstract><doi>10.48550/arxiv.2212.00239</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2212.00239
ispartof
issn
language eng
recordid cdi_arxiv_primary_2212_00239
source arXiv.org
subjects Computer Science - Computation and Language
Computer Science - Sound
title Inconsistency Ranking-based Noisy Label Detection for High-quality Data
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T07%3A27%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Inconsistency%20Ranking-based%20Noisy%20Label%20Detection%20for%20High-quality%20Data&rft.au=Yuan,%20Ruibin&rft.date=2022-11-30&rft_id=info:doi/10.48550/arxiv.2212.00239&rft_dat=%3Carxiv_GOX%3E2212_00239%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true