Pseudo Label Selection is a Decision Problem
Julian Rodemann

TL;DR
This paper introduces BPLS, a Bayesian decision-theoretic framework for pseudo-label selection in semi-supervised learning, which reduces confirmation bias and improves robustness over traditional methods.
Contribution
It develops a novel Bayesian pseudo posterior predictive criterion for pseudo-label selection, enhancing robustness against overfitting and modeling assumptions.
Findings
BPLS outperforms traditional PLS in overfitting-prone data scenarios.
The Bayesian framework improves robustness to modeling assumptions.
The utility function can incorporate various sources of uncertainty.
Abstract
Pseudo-Labeling is a simple and effective approach to semi-supervised learning. It requires criteria that guide the selection of pseudo-labeled data. The latter have been shown to crucially affect pseudo-labeling's generalization performance. Several such criteria exist and were proven to work reasonably well in practice. However, their performance often depends on the initial model fit on labeled data. Early overfitting can be propagated to the final model by choosing instances with overconfident but wrong predictions, often called confirmation bias. In two recent works, we demonstrate that pseudo-label selection (PLS) can be naturally embedded into decision theory. This paves the way for BPLS, a Bayesian framework for PLS that mitigates the issue of confirmation bias. At its heart is a novel selection criterion: an analytical approximation of the posterior predictive of pseudo-samples…
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
TopicsMachine Learning and Data Classification · Infrastructure Maintenance and Monitoring · Neural Networks and Applications
