Information Theoretic Regularization for Semi-Supervised Boosting

Document Type

Conference Proceeding

Publication Date


Find in a Library

Catalog Record


We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labeled and unlabeled training data. Our approach is based on extending information regularization framework to boosting, bearing loss functions that combine log loss on labeled data with the information-theoretic measures to encode unlabeled data. Even though the information-theoretic regularization terms make the optimization non-convex, we propose simple sequential gradient descent optimization algorithms, and obtain impressively improved results on synthetic, benchmark and real world tasks over supervised boosting algorithms which use the labeled data alone and a state-of-the-art semi-supervised boosting algorithm.


This paper was presented at the KDD2009 in Paris, France on June 28-July 1, 2009.



Catalog Record