Asymptotic Analysis of Generative Semi-Supervised Learning

Semi-supervised learning has emerged as a popular framework for improving modeling accuracy while controlling labeling cost. Based on an extension of stochastic composite likelihood we quantify the asymptotic accuracy of generative semi-supervised learning. In doing so, we complement distributionfree analysis by providing an alternative framework to measure the value associated with different labeling policies and resolve the fundamental question of how much data to label and in what manner. We demonstrate our approach with both simulation studies and real world experiments using naive Bayes for text classification and MRFs and CRFs for structured prediction in NLP.

• Type: Conference
• Year: 2010
• Where: ICML
• Authors: Joshua Dillon, Krishnakumar Balasubramanian, Guy Lebanon
• Keywords: Generative Semi-supervised Learning, ICML 2010, Machine Learning, Semi-supervised Learning, Stochastic Composite Likelihood