SVM soft margin classifiers: Linear programming versus quadratic programming

Neural Computation

Volumn 17, Issue 5, 2005, Pages 1160-1187

  Wu, Qiang ^a   Zhou, Ding Xuan ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17444402055     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/0899766053491896     Document Type: Article

References (38)

1. Anthony, M., & Bartlett, P. L. (1999). Neural network learning: Theoretical foundations. Cambridge: Cambridge University Press.
2. Aronszajn, N. (1950). Theory of reproducing kernels. Trans. Amer. Math. Soc., 68, 337-404.
3. Barron, A. R. (1990). Complexity regularization with applications to artificial neural networks. In G. Roussa (Ed.), Nonparametric functional estimation (pp. 561-576). Dordrecht: Kluwer.
4. Bartlett, P. L. (1998). The sample complexity of pattern classification with neural networks: The size of the weights is more important than the size of the network. IEEE Trans. Inform. Theory, 44, 525-536.
5. Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2003). Convexity, classification, and risk bounds. Unpublished manuscript.
6. Blanchard, G., Bousquet, O., & Massart, P. (2004). Statistical performance of support vector machines. Unpublished manuscript.
7. Boser, B. E., Guyon, I., & Vapnik, V. (1992). A training algorithm for optimal margin classifiers. In Proceedings of the Fifth Annual Workshop of Computational Learning Theory (Vol. 5, pp. 144-152). Pittsburgh, PA: ACM.
8. Bousquet, O., & Elisseeff, A. (2002). Stability and generalization. J. Machine Learning Research, 2, 499-526.
9. Bradley, P. S., & Mangasarian, O. L. (2000). Massive data discrimination via linear support vector machines. Optimization Methods and Software, 13, 1-10.
10. Chen, D. R., Wu, Q., Ying, Y., & Zhou, D. X. (2004). Support vector machine soft margin classifiers: Error analysis. J. Machine Learning Research, 5, 1143-1175.
11. Cortes, C., & Vapnik, V. (1995). Support-vector networks. Mach. Learning, 20, 273-297.
12. Cristianini, N., & Shawe-Taylor, J. (2000). An introduction to support vector machines. Cambridge: Cambridge University Press.
13. Cucker, F., & Smale, S. (2001). On the mathematical foundations of learning. Bull. Amer. Math. Soc., 39, 1-49.
14. Devroye, L, Györfi, L., & Lugosi, G. (1997). A probabilistic theory of pattern recognition. New York: Springer-Verlag.
15. Evgeniou, T., Pontil, M., & Poggio, T. (2000). Regularization networks and support vector machines. Adv. Comput. Math., 13, 1-50.
16. Kecman, V., & Hadzic, I. (2000). Support vector selection by linear programming. Proc. IJCNN, 5, 193-198.
17. Lugosi, G., & Vayatis, N. (2004). On the Bayes-risk consistency of regularized boosting methods. Ann. Statis., 32, 30-55.
18. Mendelson, S. (2002). Improving the sample complexity using global data. IEEE Trans. Inform. Theory, 48, 1977-1991.
19. Mukherjee, S., Rifkin, R., & Poggio, T. (2002). Regression and classification with regularization. In D. D. Denison, M. H. Hansen, C. C. Holmes, B. Mallick, & B. Yu (Eds.), Nonlinear estimation and classification (pp. 107-124). New York: Springer-Verlag.
20. Niyogi, P. (1998). The informational complexity of learning. Norwell, MA: Kluwer.
21. Niyogi, P., & Girosi, F. (1996). On the relationship between generalization error, hypothesis complexity, and sample complexity for radial basis functions. Neural Comp., 8, 819-842.
22. Pedroso, J. P., & Murata, N. (2001). Support vector machines with different norms: Motivation, formulations and results. Pattern Recognition Letters, 22, 1263-1272.
23. Pontil, M. (2003). A note on different covering numbers in learning theory. J. Complexity, 19, 665-671.
24. Rosasco, L., De Vito, E., Caponnetto, A., Piana, M., & Verri, A. (2004). Are loss functions all the same? Neural Comp., 16, 1063-1076.
25. Scovel, C., & Steinwart, I. (in press). Fast rates for support vector machines.
26. Smale, S., & Zhou, D. X. (2003). Estimating the approximation error in learning theory. Anal. Appl., 1, 17-41.
27. Smale, S., & Zhou, D. X. (2004). Shannon sampling and function reconstruction from point values. Bull. Amer. Math. Soc., 41, 279-305.
28. Steinwart, I. (2002). Support vector machines are universally consistent. J. Complexity, 18, 768-791.
29. Tsybakov, A. B. (2004). Optimal aggregation of classifiers in statistical learning. Ann. Statis., 32, 135-166.
30. van der Vaart, A. W., & Wellner, J. A. (1996). Weak convergence and empirical processes. New York: Springer-Verlag.
31. Vapnik, V. (1998). Statistical learning theory. New York: Wiley.
32. Wahba, G. (1990). Spline models for observational data Philadelphia: SIAM.
33. Wu, Q., Ying, Y., & Zhou, D. X. (In press). Multi-kernel regularized classifiers.
34. Wu, Q., & Zhou, D. X. (2004). Analysis of support vector machine classification. Manuscript submitted for publication.
35. Zhang, T. (2002). Covering number bounds of certain regularized linear function classes. J. Machine Learning Research, 2, 527-550.
36. Zhang, T. (2004). Statistical behavior and consistency of classification methods based on convex risk minimization. Ann. Statis., 32, 56-85.
37. Zhou, D. X. (2002). The covering number in learning theory. J. Complexity, 18, 739-767.
38. Zhou, D. X. (2003). Capacity of reproducing kernel spaces in learning theory. IEEE Trans. Inform. Theory, 49, 1743-1752.