On Extending the SMO Algorithm Sub-Problem

—The Support Vector Machine is a widely employed machine learning model due to its repeatedly demonstrated superior generalization performance. The Sequential Minimal Optimization (SMO) algorithm is one of the most popular SVM training approaches. SMO is fast, as well as easy to implement; however, it has a limited working set size (2 points only). Faster training times can result if the working set size can be increased without significantly increasing the computational complexity. In this paper, we extend the 2-point SMO formulation to a 4-point formulation and address the theoretical issues associated with such an extension. We show that modifying the SMO algorithm to increase the working set size is beneficial in terms of the number of iterations required for convergence, and shows promise for reducing the overall training time.

• Type: Conference
• Year: 2007
• Where: IJCNN
• Authors: Christopher Sentelle, Michael Georgiopoulos, Georgios C. Anagnostopoulos, Cynthia Young
• Keywords: 2-point Smo Formulation, IJCNN 2007, SMO Algorithm, Working Set Size