Improving the Instance-Dependent Transition Matrix Estimation by Exploiting Self-Supervised Learning

doi:10.1109/TPAMI.2025.3595613

Improving the Instance-Dependent Transition Matrix Estimation by Exploiting Self-Supervised Learning

0

PRE

AI

DOI：10.1109/TPAMI.2025.3595613

Original

Original request for help

Save

Abstract

En 中文

The <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">transition matrix</i> reveals the transition relationship between clean labels and noisy labels. It plays an important role in building statistically consistent classifiers for learning with noisy labels. However, in real-world applications, the transition matrix is usually unknown and has to be estimated. It is a challenging task to accurately estimate the transition matrix which usually depends on the instance. With both instances and noisy labels at hand, the major difficulty of estimating the transition matrix comes from the absence of clean label information. Recent work suggests that self-supervised learning methods can effectively infer clean label information. These methods could even achieve comparable performance with supervised learning on many benchmark datasets but without requiring any labels. Motivated by this, our paper presents a practical approach that harnesses self-supervised learning to extract clean label information, which reduces the estimation error of the instance-dependent transition matrix. By exploiting the estimated transition matrix, the performance of classifiers is improved. Empirical results on different datasets illustrate that our proposed methodology outperforms existing state-of-the-art methods in terms of both classification accuracy and transition matrix estimation.

Keywords:

Label-noise learning

instance-dependent transition matrix estimation

instance-dependent label errors

self-supervised learning

Improving the Instance-Dependent Transition Matrix Estimation by Exploiting Self-Supervised Learning

Abstract

Journal

Organization