This article points out an important source of inefficiency in Platt's sequ
ential minimal optimization (SMO) algorithm that is caused by the use of a
single threshold value. Using clues from the KKT conditions for the dual pr
oblem, two threshold parameters are employed to derive modifications of SMO
. These modified algorithms perform significantly faster than the original
SMO on all benchmark data sets tried.