A study on SMO-type decomposition methods for support vector machines.
Decomposition methods are currently one of the major methods for training support vector machines. They vary mainly according to different working set selections. Existing implementations and analysis usually consider some specific selection rules. This paper studies sequential minimal optimization type decomposition methods under a general and flexible way of choosing the two-element working set. The main results include: 1) a simple asymptotic convergence proof, 2) a general explanation of the shrinking and caching techniques, and 3) the linear convergence of the methods. Extensions to some support vector machine variants are also discussed.
Chen
Pai-Hsuen
PH
Fan
Rong-En
RE
Lin
Chih-Jen
CJ
D000465:Algorithms; D001185:Artificial Intelligence; D009716:Numerical Analysis, Computer-Assisted