Contrastive Pessimistic Likelihood Estimation for Semi-Supervised Classification
Not on the map. Why?
Abstract (arXiv)
Improvement guarantees for semi-supervised classifiers can currently only be given under restrictive conditions on the data. We propose a general way to perform semi-supervised parameter estimation for likelihood-based classifiers for which, on the full training set, the estimates are never worse than the supervised solution in terms of the log-likelihood. We argue, moreover, that we may expect these solutions to really improve upon the supervised classifier in particular cases. In a worked-out example for LDA, we take it one step further and essentially prove that its semi-supervised version is strictly better than its supervised counterpart. The two new concepts that form the core of our estimation principle are contrast and pessimism. The former refers to the fact that our objective function takes the supervised estimates into account, enabling the semi-supervised solution to explicitly control the potential improvements over this estimate. The latter refers to the fact that our estimates are conservative and therefore resilient to whatever form the true labeling of the unlabeled data takes on. Experiments demonstrate the improvements in terms of both the log-likelihood and the classification error rate on independent test sets.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 1 Mar 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 0; 2025: 0; 2026: 1.
6 papers.
- 2021Dash: Semi-Supervised Learning with Dynamic Thresholdingcited by 148
- 2022Don't fear the unlabelled: safe semi-supervised learning via simple debiasingcited by 10
- 2021Multi-class Probabilistic Bounds for Self-learningcited by 3
- 2023A Survey of Time Series Anomaly Detection Methods in the AIOps Domaincited by 2
- 2023Iterative self-transfer learning: A general methodology for response time-history prediction based on small datasetcited by 1
- 2026High-dimensional Semi-supervised Classification via the Fermat Distancecited by 1
- 2026High-dimensional Semi-supervised Classification via the Fermat Distance26 Apr 2026
- 2023A Survey of Time Series Anomaly Detection Methods in the AIOps Domain1 Aug 2023
- 2023Iterative self-transfer learning: A general methodology for response time-history prediction based on small dataset14 Jun 2023
- 2022Don't fear the unlabelled: safe semi-supervised learning via simple debiasing14 Mar 2022
- 2021Multi-class Probabilistic Bounds for Self-learning29 Sep 2021
- 2021Dash: Semi-Supervised Learning with Dynamic Thresholding1 Sep 2021