Reduction from Complementary-Label Learning to Probability Estimates
Wei-I Lin, Hsuan-Tien Lin

TL;DR
This paper introduces a novel reduction framework from Complementary-Label Learning to probability estimates, enabling more robust classifiers and validation methods, with empirical evidence supporting its effectiveness.
Contribution
It proposes a new reduction approach to probability estimates for CLL, explaining existing methods, improving robustness, and enabling validation without full labels.
Findings
Framework improves robustness in noisy environments
Empirical results validate effectiveness across settings
Provides a new validation procedure based on probability estimates
Abstract
Complementary-Label Learning (CLL) is a weakly-supervised learning problem that aims to learn a multi-class classifier from only complementary labels, which indicate a class to which an instance does not belong. Existing approaches mainly adopt the paradigm of reduction to ordinary classification, which applies specific transformations and surrogate losses to connect CLL back to ordinary classification. Those approaches, however, face several limitations, such as the tendency to overfit or be hooked on deep models. In this paper, we sidestep those limitations with a novel perspective--reduction to probability estimates of complementary classes. We prove that accurate probability estimates of complementary labels lead to good classifiers through a simple decoding step. The proof establishes a reduction framework from CLL to probability estimates. The framework offers explanations of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsText and Document Classification Technologies · Music and Audio Processing · Machine Learning and Data Classification
