Newshot

Not All Mislabels Are Equal: Efficient Task-Aware Auditing with Confidence Sequences

Summary

arXiv:2610.33262v2 Announce Type: replace-cross Abstract: We study efficient, adaptive auditing of categorical labels in a fixed dataset, motivated by biodiversity credit programs in which expert verification of species records is costly and downstream scores (e.g., payment) are more sensitive to errors on certain labels than on others. Our proposed ATLAS framework couples anytime-valid inference with a task-aware adaptive auditing policy. Representing label corrections through a confusion matrix, we prioritize which data points to inspect next based on both label uncertainty and the influence of potential label corrections on the downstream score function. In our main case study on Kenyan biodiversity data, task-aware auditing reduces the expert review needed to estimate both the mislabel rate and the nonlinear biodiversity score while maintaining anytime-valid guarantees. We also evaluate ATLAS on public datasets for image classification and named-entity recognition. Across our exper…

Original text(via arXiv stat.ML)

Statistics > Methodology

Title:Not All Mislabels Are Equal: Efficient Task-Aware Auditing with Confidence Sequences

Abstract:We study efficient, adaptive auditing of categorical labels in a fixed dataset, motivated by biodiversity credit programs in which expert verification of species records is costly and downstream scores (e.g., payment) are more sensitive to errors on certain labels than on others. Our proposed ATLAS framework couples anytime-valid inference with a task-aware adaptive auditing policy. Representing label corrections through a confusion matrix, we prioritize which data points to inspect next based on both label uncertainty and the influence of potential label corrections on the downstream score function. In our main case study on Kenyan biodiversity data, task-aware auditing reduces the expert review needed to estimate both the mislabel rate and the nonlinear biodiversity score while maintaining anytime-valid guarantees. We also evaluate ATLAS on public datasets for image classification and named-entity recognition. Across our experiments with linear and nonlinear scores, ATLAS generally reaches the same precision as competing anytime-valid methods with substantially fewer audits. When distribution-free guarantees are prohibitively costly, we develop a model-based Bayesian alternative that can further reduce the number of audits by relying on modeling assumptions. Our biodiversity case study highlights a gap between statistical validity and practical feasibility: generic methods such as Serfling's bound and existing confidence-sequence procedures are rigorous but can require prohibitively many expert reviews in practice. Together, these results show task-aware auditing can significantly reduce the number of expert audits needed while providing finite-sample, anytime-valid guarantees
Subjects:Methodology (stat.ME) ; Machine Learning (cs.LG); Statistics Theory (math.ST); Applications (stat.AP); Machine Learning (stat.ML)
MSC classes:62L12 (Primary), 62P12, 62D05, 62G15, 62L05 (Secondary)
ACM classes:G.3
Cite as:arXiv:2610.33262 [stat.ME]
(or arXiv:2610.33262v2 [stat.ME] for this version)
https://doi.org/10.48550/arXiv.2610.33262 arXiv-issued DOI via DataCite

Submission history

Access Paper:

  • HTML (experimental)

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

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.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv stat.ML
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗