A Modified Fixed-Threshold SMO for 1-Slack Structural SVMs

초록

In this paper, we describe a modified fixed-threshold sequential minimal optimization (FSMO) for 1-stack structural support vector machine (SVM) problems. Because the modified FSMO uses the fact that the formulation of 1-slack structural SVMs has no bias, it breaks down the quadratic programming (QP) problems of 1-slack structural SVMs into a series of smallest QP problems, each involving only one variable. For various test sets, the modified FSMO is as accurate as existing structural SVM implementations (n-slack and 1-slack SVM-struct) but is faster on large data sets.

키워드