title: A Simple Label Switching Algorithm for Semisupervised Structural SVMs.
abstract: In structured output learning, obtaining labeled data for real-world applications is usually costly, while unlabeled examples are available in abundance. Semisupervised structured classification deals with a small number of labeled examples and a large number of unlabeled structured data. In this work, we consider semisupervised structural support vector machines with domain constraints. The optimization problem, which in general is not convex, contains the loss terms associated with the labeled and unlabeled examples, along with the domain constraints. We propose a simple optimization approach that alternates between solving a supervised learning problem and a constraint matching problem. Solving the constraint matching problem is difficult for structured prediction, and we propose an efficient and effective label switching method to solve it. The alternating optimization is carried out within a deterministic annealing framework, which helps in effective constraint matching and avoiding poor local minima, which are not very useful. The algorithm is simple and easy to implement. Further, it is suitable for any structured output learning problem where exact inference is available. Experiments on benchmark sequence labeling data sets and a natural language parsing data set show that the proposed approach, though simple, achieves comparable generalization performance.
authors: Sierra Project Group, INRIA, Paris 75013, France balamurugan.palaniappan@inria.fr.
authors: P
authors: P
authors: Balamurugan
authors: Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India shirish@csa.iisc.ernet.in.
authors: Shirish
authors: S
authors: Shevade
authors: Microsoft Research, Bangalore 560001, India ssrajan@microsoft.com.
authors: S
authors: S
authors: Sundararajan