Semi-Supervised Classifications via Elastic and Robust Embedding

Transductive semi-supervised learning can only predict labels for unlabeled data appearing in training data, and can not predict labels for testing data never appearing in training set. To handle this out-of-sample problem, many inductive methods make a constraint such that the predicted label matrix should be exactly equal to a linear model. In practice, this constraint might be too rigid to capture the manifold structure of data. In this paper, we relax this rigid constraint and propose to use an elastic constraint on the predicted label matrix such that the manifold structure can be better explored. Moreover, since unlabeled data are often very abundant in practice and usually there are some outliers, we use a non-squared loss instead of the traditional squared loss to learn a robust model. The derived problem, although is convex, has so many nonsmooth terms, which make it very challenging to solve. In the paper, we propose an efficient optimization algorithm to solve a more general problem, based on which we find the optimal solution to the derived problem.

Authors

• Yun Liu College of Artificial Intelligence, Southwest University, Chongqing, China College of Computing and Data Science, Nanyang Technological University, Singapore, Singapore
• Yiming Guo
• Hua Wang
• Feiping Nie Northwest Polytechnical University Xi'an
• Heng Huang University of Maryland at College Park

Keywords

No keywords are indexed for this paper.