Improvements to the SMO algorithm for SVM regression

Shirish K. Shevade, S. Sathiya Keerthi, Chiranjib Bhattacharyya, K. R. K. Murthy

Abstract: This paper points out an important source of inefficiency in Smola and Scholkopf's (1998) sequential minimal optimization (SMO) algorithm for support vector machine regression that is caused by the use of a single threshold value. Using clues from the Karush-Kuhn-Tucker conditions for the dual problem, two threshold parameters are employed to derive modifications of SMO for regression. These modified algorithms perform significantly faster than the original SMO on the datasets tried.