Sciweavers

Share
ESANN
2008

On related violating pairs for working set selection in SMO algorithms

11 years 2 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this iterative algorithm proofs of convergence to the optimum exist. Nevertheless, to find such proofs for elaborated SMO-type algorithms is challenging in general. We provide a basic tool for such convergence proofs in the context of cache-friendly working set selection. Finally this result is applied to notably simplify the convergence proof of the very efficient Hybrid Maximum Gain algorithm.
Tobias Glasmachers
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where ESANN
Authors Tobias Glasmachers
Comments (0)
books