Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > stat > arXiv:1911.00068v1

Help | Advanced Search

Statistics > Machine Learning

arXiv:1911.00068v1 (stat)
[Submitted on 31 Oct 2019 (this version) , latest version 22 Aug 2022 (v6) ]

Title: Confident Learning: Estimating Uncertainty in Dataset Labels

Title: 置信学习:估计数据集标签中的不确定性

Authors:Curtis G. Northcutt, Lu Jiang, Isaac L. Chuang
Abstract: Learning exists in the context of data, yet notions of $\textit{confidence}$ typically focus on model predictions, not label quality. Confident learning (CL) has emerged as an approach for characterizing, identifying, and learning with noisy labels in datasets, based on the principles of pruning noisy data, counting to estimate noise, and ranking examples to train with confidence. Here, we generalize CL, building on the assumption of a classification noise process, to directly estimate the joint distribution between noisy (given) labels and uncorrupted (unknown) labels. This generalized CL, open-sourced as $\texttt{cleanlab}$, is provably consistent under reasonable conditions, and experimentally performant on ImageNet and CIFAR, outperforming recent approaches, e.g. MentorNet, by $30\%$ or more, when label noise is non-uniform. $\texttt{cleanlab}$ also quantifies ontological class overlap, and can increase model accuracy (e.g. ResNet) by providing clean data for training.
Abstract: 学习存在于数据的背景下,然而关于$\textit{confidence}$的概念通常关注于模型预测,而不是标签质量。 自信学习(CL)作为一种方法,在数据集中基于清理噪声数据、计数估计噪声以及对示例进行排序以自信地训练的原则上,已经出现用于表征、识别和学习带有噪声标签的数据集。 在这里,我们基于分类噪声过程的假设,推广了CL,直接估计有噪声(给定)标签与未被污染(未知)标签之间的联合分布。 这种广义的CL,开源为$\texttt{cleanlab}$,在合理条件下具有理论一致性,并且在ImageNet和CIFAR上的实验表现优于最近的方法,例如当标签噪声非均匀时,比MentorNet高出$30\%$或更多。 $\texttt{cleanlab}$还量化了本体类别的重叠,并可以通过提供干净的数据来提高模型准确性(例如ResNet)。
Subjects: Machine Learning (stat.ML) ; Machine Learning (cs.LG)
Cite as: arXiv:1911.00068 [stat.ML]
  (or arXiv:1911.00068v1 [stat.ML] for this version)
  https://doi.org/10.48550/arXiv.1911.00068
arXiv-issued DOI via DataCite

Submission history

From: Curtis Northcutt [view email]
[v1] Thu, 31 Oct 2019 19:26:33 UTC (5,947 KB)
[v2] Fri, 21 Feb 2020 22:16:56 UTC (11,711 KB)
[v3] Fri, 4 Sep 2020 08:12:20 UTC (11,007 KB)
[v4] Mon, 15 Feb 2021 23:56:53 UTC (22,061 KB)
[v5] Thu, 8 Apr 2021 20:00:05 UTC (21,851 KB)
[v6] Mon, 22 Aug 2022 00:58:03 UTC (21,851 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
stat.ML
< prev   |   next >
new | recent | 2019-11
Change to browse by:
cs
cs.LG
stat

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号