Online learning of approximate maximum p-norm margin classifiers with bias

21st Annual Conference on Learning Theory, COLT 2008

Volumn , Issue , 2008, Pages 69-80

  Ishibashi, Kosuke ^a   Hatano, Kohei ^a   Takeda, Masayuki ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR CLASSIFIERS; MARGIN CLASSIFIERS; MAXIMUM MARGIN; ONLINE LEARNING; ONLINE LEARNING ALGORITHMS;

LEARNING ALGORITHMS;

EID: 80054116173     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. J. K. Anlauf and M. Biehl. The adatron; an adaptive perceptron algorithm. Europhysics Letters, 10: 687-692, 1989.
2. A. Asuncion and D. J. Newman. UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences, http://mlearn.ics.uci.edu/MLRepository.html, 2007.
3. H. H. Bauschke and P. L. Combettes. A weak-to-strong convergence principle for Fejér-monotone methods in hilbelt spaces. Mathematics of Operations Research, 26(2): 248-264, 2001.
4. A. Bordes, S. Ertekin, J. Weston, and Léon Bottou. Fast kernel classifiers with online and active learning. Journal of Machine Learning Research, 6: 1579-1619, 2005.
5. B. E. Boser, I. Guyon, and V. Vapnik. A training algorithm for optimal margin classifiers. In Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, pages 144-152, 1992.
6. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
7. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
8. C. C. Chang and C. J. Lin. Libsvm: a library for support vector machines. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm, 2001.
9. C. Cortes and V. Vapnik. Support vector networks. Machine Learning, 20: 273-297, 1995.
10. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machine. Cambridge University Press, 2000.
11. Y. Freund and R. E. Schapire. Large margin classification using the perceptron algorithm. Machine Learning, 37(3): 277-299, 1999.
12. T. Friess, N. Cristianini, and C. Campbell. The kernel adatron algorithm: a fast and simple learning procedure for support vector machine. In Proceedings of the 15th International Conference on Machine Learning, 1998.
13. C. Gentile. A new approximate maximal margin classification algorithm. Journal of Machine Learning Research, 2: 213-242, 2001.
14. C. Gentile. The robustness of the p-norm algorithms. Machine Learning, 53(3): 265-299, 2003.
15. A. J. Grove, N. Littlestone, and D. Schuurmans. General convergence results for linear discriminant updates. In Proceedings of the tenth anual conference of Computational learning theory, pages 171-183, 1997.
16. T. Joachims. Making large-scale support vector machine learning practical. In A. Smola B. Schölkopf, C. Burges, editor, Advances in kernel methods - Support vector learning, pages 169-184. MIT Press, 1999.
17. T. Joachims. Training linear svms in linear time. In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD), 2006.
18. S. S. Keerthi, S. K. Shevade, C. Bhattacharyya, and K. R. K. Murthy. A fast iterative nearest point algorithm for support vector machine classifier design. IEEE Transactions on Neural Networks, 11(1): 124-136, 2000.
19. J. Kivinen, A. J. Smola, and R. C. Williamson. Online learning with kernels. IEEE Transactions on Signal Processing, 52(8): 2165-2176, 2004.
20. J. Kivinen, M. K. Warmuth, and P. Auer. The perceptron algorithm versus winnow: linear versus logarithmic mistake bounds when few input variables are relevant. Artificial Intelligence, 97(1-2): 325-343, 1997.
21. A. Kowalczyk. Maximum margin perceptron. In B. Scholkopf A. Smola, P. Bartlett and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 75-114. MIT Press, 2000.
22. Y. Li and P. M. Long. The relaxed online maximum margin algorithm. Machine Learning, 46(1-3): 361-387, 2002.
23. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4): 285-318, 1988.
24. P. M. Long and X. Wu. Mistake bounds for maximum entropy discrimination. In Advances in Neural Information Processing Systems 17, pages 833-840, 2004.
25. O. L. Mangasarian. Arbitrary-norm separating plane. Operations Research Letters, 24: 15-23, 1999.
26. M. L. Minsky and S. A. Papert. Perceptrons. MIT Press, 1969.
27. A. B. Novikoff. On convergence proofs on perceptrons. In Symposium on the Mathematical Theory of Automata, volume 12, pages 615-622. Polytechnic Institute of Brooklyn, 1962.
28. E. Osuna, R. Freund, and F. Girosi. Improved training algorithm for support vector machines. In Proceedings of IEEE NNSP'97, 1997.
29. J. Platt. Fast training of support vector machines using sequential minimal optimization. In B. Scholköpf, C. Burges, and A. Smola, editors, Advances in Kernel Methods - Support Vector Learning, pages 185-208. MIT Press, 1999.
30. R. T. Rockafellar. Convex Analysis. Princeton University Press, 1970.
31. Frank Rosenblatt. The perceptron: a probabilistic model for information storage and organization in the brain. Psychological Review, 65: 386-408, 1959.
32. R. E. Schapire, Y. Freund, P. Bartlett, and W. S. Lee. Boosting the margin: a new explanation for the effectiveness of voting methods. The Annals of Statistics, 26(5): 1651-1686, 1998.
33. S. Shalev-Shwartz, Y. Singer, and N. Srebro. Pegasos: Primal estimated sub-gradient solver for svm. In Proceedings of the 24th International Conference on Machine Learning, 2007.
34. J. Shawe-Taylor, P. L. Bartlett, R. C. Williamson, and M. Anthony. Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5): 1926-1940, 1998.
35. P. Tsampouka and J. Shawe-Taylor. Approximate maximum margin algorithms with rules controlled by the number of mistakes. In Proceedings of the 24th International Conference on Machine Learning, 2007.