Sign inGet started
Paper · arXiv

Estimation of the Label-Noise Transition Matrix with Performance Guarantees via Selective Classification

Modern machine learning depends heavily on massive datasets, but obtaining high-quality annotations at scale is often expensive. As a result, learning from noisily-labeled data has become common, making accurate estimation of the label-noise transition matrix crucial. However, existing transition matrix estimators rely on the fragile estimation of class-posteriors and do not provide finite-sample performance guarantees. In this work, we propose a novel methodology to estimate the transition matrix based on one-sided selective classification. This approach bypasses class-posterior estimation, provides finite-sample performance guarantees, and leverages flexible learning methods for binary ...

AuthorsXabier de Juan, Santiago Mazuelas, Yilun Zhu et al.
Primary categorystat.ML
Published30 September 2026
Last updated at source30 September 2026
stat.MLcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/a78e362a-be42-4641-8159-7307d05cb527" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.