On the complexity of working set selection

Theoretical Computer Science

Volumn 382, Issue 3, 2007, Pages 262-279

  Simon, Hans Ulrich ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Approximation algorithms; Decomposition method; Support vector machines; Working set selection

Indexed keywords

APPROXIMATION ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SUPPORT VECTOR MACHINES;

DECOMPOSITION METHOD; OPTIMAL SOLUTIONS; SVM-OPTIMIZATION; WORKING SET SELECTION;

QUADRATIC PROGRAMMING;

EID: 34547830949     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.03.041     Document Type: Article

References (34)

1. Bernhard E. Boser, Isabelle M. Guyon, Vladimir N. Vapnik, A training algorithm for optimal margin classifiers, in: Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, 1992, pp. 144-152
2. Caprara A., Kellerer H., Pferschy U., and Pisinger D. Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research 123 2 (2000) 333-345
3. Chang C.-C., Hsu C.-W., and Lin C.-J. The analysis of decomposition methods for support vector machines. IEEE Transactions on Neural Networks 11 4 (2000) 248-250
4. Chih-Chung Chang, Chih-Jen Lin, LIBSVM: A library for support vector machines, 2001. Available from: http://www.csie.ntu.edu.tw/~cjlin/libsvm
5. Pai-Hsuen Chen, Rong-En Fan, Chih-Jen Lin, Training support vector machines via SMO-type decomposition methods, in: Proceedings of the 16th International Conference on Algorithmic Learning Theory, 2005, pp. 45-62
6. Chen P.-H., Fan R.-E., and Lin C.-J. A study on SMO-type decomposition methods for support vector machines. IEEE Transactions on Neural Networks 17 4 (2006) 893-908
7. Hsu C.-W., and Lin C.-J. A simple decomposition method for support vector machines. Machine Learning 46 1-3 (2002) 291-314
8. Hush D., Kelly P., Scovel C., and Steinwart I. QP algorithms with guaranteed accuracy and run time for support vector machines. Journal of Machine Learning Research 7 (2007) 733-769
9. Hush D., and Scovel C. Polynomial-time decomposition algorithms for support vector machines. Machine Learning 51 1 (2003) 51-71
10. Ibarra O.H., and Kim C.E. Fast approximation algorithms for knapsack and sum of subset problem. Journal of the Association on Computing Machinery 22 4 (1975) 463-468
11. Joachims T. Making large scale SVM learning practical. In: Schölkopf B., Burges C.J.C., and Smola A.J. (Eds). Advances in Kernel Methods-Support Vector Learning (1998), MIT Press 169-184
12. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press 85-103
13. Sathiya Keerthi S., and Gilbert E.G. Convergence of a generalized SMO algorithm for SVM classifier design. Machine Learning 46 1-3 (2002) 351-360
14. Sathiya Keerthi S., Shevade S., Bhattacharyya C., and Murthy K.R.K. Improvements to SMO algorithm for SVM regression. IEEE Transactions on Neural Networks 11 5 (2000) 1188-1193
15. Sathiya Keerthi S., Shevade S.K., Bhattacharyya C., and Murthy K.R.K. Improvements to Platt's SMO algorithm for SVM classifier design. Neural Computation 13 3 (2001) 637-649
16. Korte B., and Schrader R. On the existence of fast approximation schemes. In: Mangasarian O.L., Meyer R.R., and Robinson S.M. (Eds). Nonlinear Programming vol. 4 (1981), Academic Press 415-437
17. Laskov P. Feasible direction decomposition algorithms for training support vector machines. Machine Learning 46 1-3 (2002) 315-349
18. Liao S.-P., Lin H.-T., and Lin C.-J. A note on the decomposition methods for support vector regression. Neural Computation 14 6 (2002) 1267-1281
19. Chih-Jen Lin, Linear convergence of a decomposition method for support vector machines, 2001. Available from: http://www.csie.ntu.edu.tw/~cjlin/papers/linearconv.pdf
20. Lin C.-J. On the convergence of the decomposition method for support vector machines. IEEE Transactions on Neural Networks 12 6 (2001) 1288-1298
21. Lin C.-J. Asymptotic convergence of an SMO algorithm without any assumptions. IEEE Transactions on Neural Networks 13 1 (2002) 248-250
22. Lin C.-J. A formal analysis of stopping criteria of decomposition methods for support vector machines. IEEE Transactions on Neural Networks 13 5 (2002) 1045-1052
23. Nikolas List, Personal communication
24. Nikolas List, Convergence of a generalized gradient selection approach for the decomposition method, in: Proceedings of the 15th International Conference on Algorithmic Learning Theory, 2004, pp. 338-349
25. Nikolas List, Hans Ulrich Simon, A general convergence theorem for the decomposition method, in: Proceedings of the 17th Annual Conference on Computational Learning Theory, 2004, pp. 363-377
26. Nikolas List, Hans Ulrich Simon, General polynomial time decomposition algorithms, in: Proceedings of the 17th Annual Conference on Computational Learning Theory, 2005, pp. 308-322
27. Mangasarian O.L., and Musicant D.R. Successive overrelaxation for support vector machines. IEEE Transactions on Neural Networks 10 5 (1999) 1032-1037
28. Mangasarian O.L., and Musicant D.R. Active support vector machine classification. Advances in Neural Information Processing Systems vol. 12 (2000), MIT Press 577-583
29. Mangasarian O.L., and Musicant D.R. Lagrangian support vector machines. Journal of Machine Learning Research 1 (2001) 161-177
30. Edgar E. Osuna, Robert Freund, Federico Girosi, Training support vector machines: An application to face detection, in: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 1997, pp. 130-136
31. Platt J.C. Fast training of support vector machines using sequential minimal optimization. In: Schölkopf B., Burges C.J.C., and Smola A.J. (Eds). Advances in Kernel Methods-Support Vector Learning (1998), MIT Press 185-208
32. Craig Saunders, Mark O. Stitson, Jason Weston, Leon Bottou, Bernhard Schölkopf, Alexander J. Smola, Support vector machine reference manual, Technical Report CSD-TR-98-03, Royal Holloway, University of London, Egham, UK, 1998
33. Hans Ulrich Simon, On the complexity of working set selection, in: Proceedings of the 15th International Conference on Algorithmic Learning Theory, 2004, pp. 324-337
34. Vapnik V. Statistical learning theory. Wiley Series on Adaptive and Learning Systems for Signal Processing, Communications, and Control (1998), John Wiley & Sons