We give a new proof of the convergence of the SMO algorithm for SVM training over linearly separable problems that partly builds on the one by Mitchell et al. for the convergence of the MDM algorithm to find the point of a convex set closest to the origin. Our proof relies in a simple derivation of SMO that we also present here and, while less general, it is considerably simpler than previous ones and yields algorithmic insights into the working of SMO. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
López, J., & Dorronsoro, J. R. (2009). A simple proof of the convergence of the SMO algorithm for linearly separable problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5768 LNCS, pp. 904–912). https://doi.org/10.1007/978-3-642-04274-4_93
Mendeley helps you to discover research relevant for your work.