Conic SMO

Vovsha, Ilia

We derive an SMO-like algorithm for the optimization problem arising from the Second Order Cone Programming formulation of support vector machines (SVMs) for classification. Due to the square root term in the objective of the form, we cannot easily compute the location of the extrema using Newton‘s formula. Instead we modify the analytic solution proposed for SMO (Platt, 1999), to account for the particular objective function and partial derivatives. We then establish some theoretical properties of the algorithm based on the results of (Bordes et al., 2005), and develop practical working set selection similar to (Fan et al., 2005). In addition, we propose an efficient implementation, and compare the convergence rate of Conic-SMO and SMO on synthetic data.



More About This Work

Academic Units
Center for Computational Learning Systems
Center for Computational Learning Systems, Columbia University
CCLS Technical Report, CCLS-11-03
Published Here
September 9, 2011