Jump to content

Structured support vector machine

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nowozin (talk | contribs) at 16:05, 1 November 2008 (Initial version). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The structured support vector machine is a machine learning algorithm and generalizes the Support Vector Machine (SVM) classifier. Whereas the SVM classifier support binary classification, multiclass classification and regression, the structured SVM allows training of a classifier for general structured output labels.

As an example, a sample instance might be a natural language sentence, and the output label is a an annotated parse tree. Training a classifier consists of showing pairs of correct sample and output label pairs. After training, the structured SVM model allows one to predict for new sample instances the corresponding output label; that is, given a natural language sentence, the classifier can produce the most likely parse tree.

For a set of training instances , from a sample space and label space , the structured SVM minimizes the following regularized risk function.

The function is convex in because the maximum of an set of affine functions is convex. The function measures a distance in label space and is an arbitrary function (not necessarily a metric) satisfying .

Because the regularized risk function above is non-differentiable, therefore it is often reformulated in terms of a quadratic program by introducing one slack variables for each sample, each representing the value of the maximum. The standard structured SVM primal formulation is given as follows.