Multi-class Classification from Multiple Unlabeled Datasets with Partial Risk Regularization
Not on the map. Why?
Abstract (arXiv)
Recent years have witnessed a great success of supervised deep learning, where predictive models were trained from a large amount of fully labeled data. However, in practice, labeling such big data can be very costly and may not even be possible for privacy reasons. Therefore, in this paper, we aim to learn an accurate classifier without any class labels. More specifically, we consider the case where multiple sets of unlabeled data and only their class priors, i.e., the proportions of each class, are available. Under this problem setup, we first derive an unbiased estimator of the classification risk that can be estimated from the given unlabeled sets and theoretically analyze the generalization error of the learned classifier. We then find that the classifier obtained as such tends to cause overfitting as its empirical risks go negative during training. To prevent overfitting, we further propose a partial risk regularization that maintains the partial risks with respect to unlabeled datasets and classes to certain levels. Experiments demonstrate that our method effectively mitigates overfitting and outperforms state-of-the-art methods for learning from multiple unlabeled sets.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 15 of its 37 references that are in the map. First posted on arXiv 4 Jul 2022.
Builds on
15 of 37 references.
References · 15
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2018Deep Learning for Classical Japanese Literaturecited by 415
- 2017Size-Independent Sample Complexity of Neural Networkscited by 289
- 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 217
- 2019Are Anchor Points Really Indispensable in Label-Noise Learning?cited by 208
- 2016A vector-contraction inequality for Rademacher complexitiescited by 141
- 2020Do We Need Zero Training Loss After Achieving Zero Training Error?cited by 61
- 2018On the Minimal Supervision for Training Any Binary Classifier from Only Unlabeled Datacited by 43
- 2014On Learning from Label Proportionscited by 38
- 2019Learning from Label Proportions with Consistency Regularizationcited by 34
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 2.
6 papers.
- 2024A General Framework for Learning from Weak Supervisioncited by 7
- 2023Boosting Prompt-Based Self-Training With Mapping-Free Automatic Verbalizer for Multi-Class Classificationcited by 0
- 2025Learning from M-Tuple Dominant Positive and Unlabeled Datacited by 0
- 2025A Unified and Stable Risk Minimization Framework for Weakly Supervised Learning with Theoretical Guaranteescited by 0
- 2026Generalized Distribution-Free Semi-Supervised Learning with Risk Rewritecited by 0
- 2026Multiclass Classification without Labels via Posterior Simplex Geometrycited by 0
- 2026Multiclass Classification without Labels via Posterior Simplex Geometry27 Jul 2026
- 2026Generalized Distribution-Free Semi-Supervised Learning with Risk Rewrite11 Jul 2026
- 2025A Unified and Stable Risk Minimization Framework for Weakly Supervised Learning with Theoretical Guarantees28 Nov 2025
- 2025Learning from M-Tuple Dominant Positive and Unlabeled Data25 May 2025
- 2024A General Framework for Learning from Weak Supervision2 Feb 2024
- 2023Boosting Prompt-Based Self-Training With Mapping-Free Automatic Verbalizer for Multi-Class Classification8 Dec 2023