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

Help | Advanced Search

Statistics > Machine Learning

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

Title: Confident Learning: Estimating Uncertainty in Dataset Labels

Title: Confident Learning: 估计数据集标签中的不确定性

Authors:Curtis G. Northcutt, Lu Jiang, Isaac L. Chuang
Abstract: Learning exists in the context of data, yet notions of confidence typically focus on model predictions, not label quality. Confident learning (CL) is an alternative approach which focuses instead on label quality by characterizing and identifying label errors in datasets, based on the principles of pruning noisy data, counting with probabilistic thresholds to estimate noise, and ranking examples to train with confidence. Whereas numerous studies have developed these principles independently, here, we combine them, building on the assumption of a class-conditional noise process to directly estimate the joint distribution between noisy (given) labels and uncorrupted (unknown) labels. This results in a generalized CL which is provably consistent and experimentally performant. We present sufficient conditions where CL exactly finds label errors, and show CL performance exceeding seven recent competitive approaches for learning with noisy labels on the CIFAR dataset. Uniquely, the CL framework is not coupled to a specific data modality or model (e.g., we use CL to find several label errors in the presumed error-free MNIST dataset and improve sentiment classification on text data in Amazon Reviews). We also employ CL on ImageNet to quantify ontological class overlap (e.g., estimating 645 "missile" images are mislabeled as their parent class "projectile"), and moderately increase model accuracy (e.g., for ResNet) by cleaning data prior to training. These results are replicable using the open-source cleanlab release.
Abstract: 学习存在于数据的背景下,然而置信度的概念通常关注的是模型预测,而不是标签质量。 自信学习(CL)是一种替代方法,它转而通过根据修剪噪声数据的原则、基于概率阈值计数以估计噪声以及对示例进行排序以有把握地训练,来关注标签质量,并识别数据集中存在的标签错误。 尽管许多研究已经独立开发了这些原则,但在这里,我们结合了它们,基于类别条件噪声过程的假设,直接估计嘈杂(已知)标签和未受污染(未知)标签之间的联合分布。 这导致了一种广义的CL,它在理论上是始终一致的,并且在实验上表现出色。 我们提出了CL精确找到标签错误的充分条件,并展示了CL性能在CIFAR数据集上使用噪声标签进行学习时,超过了七种最近的竞争方法。 独特的是,CL框架并不局限于特定的数据模态或模型(例如,我们用CL在被认为无误的MNIST数据集中找到了几个标签错误,并改进了Amazon评论中文本数据的情感分类)。 我们还在ImageNet上应用CL来量化本体论类别的重叠(例如,估计645张“导弹”图片被错误地标记为其父类别“投射物”),并通过在训练前清理数据,适度提高了模型准确性(例如,对于ResNet)。 这些结果可以通过开源的cleanlab发布版本进行复制。
Comments: Published in Journal of Artificial Intelligence Research (JAIR)
Subjects: Machine Learning (stat.ML) ; Machine Learning (cs.LG)
Cite as: arXiv:1911.00068 [stat.ML]
  (or arXiv:1911.00068v6 [stat.ML] for this version)
  https://doi.org/10.48550/arXiv.1911.00068
arXiv-issued DOI via DataCite
Journal reference: Journal of Artificial Intelligence Research (JAIR) (2021)

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:
cs.LG
< prev   |   next >
new | recent | 2019-11
Change to browse by:
cs
stat
stat.ML

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号