Probably Approximately Correct Labels

Emmanuel J. Candès, Andrew Ilyas, Tijana Zrnic
6/12/2025
stat.MLcs.LG

No official code found. Best implementation: tijana-zrnic/pac-labels (14 stars, last commit 2025-06-13).

Abstract

Obtaining high-quality labeled datasets is often costly, requiring either human annotation or expensive experiments. In theory, powerful pre-trained AI models provide an opportunity to automatically label datasets and save costs. Unfortunately, these models come with no guarantees on their accuracy, making wholesale replacement of manual labeling impractical. In this work, we propose a method for leveraging pre-trained AI models to curate cost-effective and high-quality datasets. In particular, our approach results in probably approximately correct labels: with high probability, the overall labeling error is small. Our method is nonasymptotically valid under minimal assumptions on the dataset or the AI model being studied, and thus enables rigorous yet efficient dataset curation using modern AI models. We demonstrate the benefits of the methodology through text annotation with large language models, image labeling with pre-trained vision models, and protein folding analysis with AlphaFold.

View on arXivView PDF

Code Implementations(1)

Code for Probably Approximately Correct (PAC) Labels

140Python, Jupyter NotebookJun 9, 20251 years agoNOASSERTION

Similar Papers

Cite this paper

@article{cands2025probably,
  title  = {Probably Approximately Correct Labels},
  author = {Emmanuel J. Candès and Andrew Ilyas and Tijana Zrnic},
  year   = {2025},
  eprint = {2506.10908},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.10908v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.10908.svg)](https://codeofpaper.com/paper/2506.10908)

Discussion