Semi-supervised Learning by Entropy Minimization

We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this framework, we motivate minimum entropy regularization, which enables to incorporate unlabeled data in the standard supervised learning. Our approach in-cludes other approaches to the semi-supervised problem as particular or limiting cases. A series of experiments illustrates that the proposed solu-tion benefits from unlabeled data. The method challenges mixture mod-els when the data are sampled from the distribution class spanned by the generative model. The performances are definitely in favor of minimum entropy regularization when generative models are misspecified, and the…