Training a support vector machine in the primal. (English) Zbl 1123.68101

Summary: Most literature on Support Vector Machines (SVMs) concentrates on the dual optimization problem. In this letter, we point out that the primal problem can also be solved efficiently for both linear and nonlinear SVMs and that there is no reason for ignoring this possibility. On the contrary, from the primal point of view, new families of algorithms for large-scale SVM training can be investigated.


68T05 Learning and adaptive systems in artificial intelligence


SVMlight; SSVM
Full Text: DOI Link


[1] DOI: 10.1023/A:1009715923555 · Zbl 05470543
[2] DOI: 10.1023/A:1012450327387 · Zbl 0998.68101
[3] DOI: 10.1162/089976602753633402 · Zbl 1003.68135
[4] DOI: 10.1162/15324430260185619 · Zbl 1037.68112
[5] DOI: 10.1016/0021-9991(87)90140-9 · Zbl 0629.65005
[6] Keerthi S., Journal of Machine Learning Research 7 pp 1493– (2006)
[7] Keerthi S. S., Journal of Machine Learning Research 6 pp 341– (2005)
[8] DOI: 10.1214/aoms/1177697089 · Zbl 0193.45201
[9] DOI: 10.1023/A:1011215321374 · Zbl 1017.90105
[10] DOI: 10.1080/1055678021000028375 · Zbl 1065.90078
[11] DOI: 10.1162/jmlr.2003.4.6.1071
[12] Tsang I. W., Journal of Machine Learning Research 6 pp 363– (2005)
[13] DOI: 10.1198/106186005X25619
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.