Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors

A Simple Proof of the Convergence of the SMO Algorithm for Linearly Separable Problems

Título: A Simple Proof of the Convergence of the SMO Algorithm for Linearly Separable Problems. International Conference in Artificial Neural Networks. Proceedings. LNCS, Lecture Notes in Computer Science. LNCS 5768, 904-912, Springer Verlag. Germany.
Autor: López, J., & Dorronsoro, J.R..
Año: 2009
Enlace: http://link.springer.com/chapter/10.1007/978-3-642-04274-4_93

Abstract

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.

Facebook
X
WhatsApp
LinkedIn
Email
IIC
Resumen de privacidad

Esta web utiliza cookies para que podamos ofrecerte la mejor experiencia de usuario posible. La información de las cookies se almacena en tu navegador y realiza funciones tales como reconocerte cuando vuelves a nuestra web o ayudar a nuestro equipo a comprender qué secciones de la web encuentras más interesantes y útiles.