Synthesis of maximum margin and multiview learning using unlabeled data

In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exploits the unlabeled data to reduce the complexity of the class of the learning functions. In order to measure how the complexity is decreased we use the Rademacher Complexity Theory. The corresponding optimization problem is convex and it is efficiently solvable for large-scale applications as well.

• Type: Conference
• Year: 2006
• Where: ESANN
• Authors: Sándor Szedmák, John Shawe-Taylor
• Keywords: ESANN 2006, ESANN 2007, Maximum Margin Problem, Rademacher Complexity Theory, Semi-supervised Learning