Learning halfspaces with the zero-one loss: Time-accuracy tradeoffs

Advances in Neural Information Processing Systems

Volumn 2, Issue , 2012, Pages 926-935

  Birnbaum, Aharon ^a   Shalev Shwartz, Shai ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL TIME; LEARNING HALFSPACES; MISCLASSIFICATION ERROR; NOISE MODELS; ONLINE LEARNING; POLYNOMIAL-TIME; SAMPLE COMPLEXITY; TIME COMPLEXITY;

POLYNOMIAL APPROXIMATION;

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

References (25)

1. S. Agmon. The relaxation method for linear inequalities. Canadian Journal of Mathematics, 6(3):382-392, 1954.
2. P. Auer and N. Cesa-Bianchi. On-line learning with malicious noise and the closure algorithm. Annals of mathematics and artificial intelligence, 23(1):83-99, 1998.
3. P. L. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3:463-482, 2002.
4. P. L. Bartlett, M. I. Jordan, and J. D. McAuliffe. Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101:138-156, 2006.
5. S. Ben-David and H. Simon. Efficient learning of linear perceptrons. In NIPS, 2000.
6. S. Ben-David, D. Pal, and S. Shalev-Shwartz. Agnostic online learning. In COLT, 2009.
7. S. Ben-David, D. Loker, N. Srebro, and K. Sridharan. Minimizing the misclassification error rate using a surrogate convex loss. In ICML, 2012.
8. E. Blais, R. O'Donnell, and KWimmer. Polynomial regression under arbitrary product distributions. In COLT, 2008.
9. O. Bousquet. Concentration Inequalities and Empirical Processes Theory Applied to the Analysis of Learning Algorithms. PhD thesis, Ecole Polytechnique, 2002.
10. N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006.
11. N. Cristianini and J. Shawe-Taylor. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
12. Y. Freund and R. E. Schapire. Large margin classification using the perceptron algorithm. Machine Learning, 37(3):277-296, 1999.
13. Y. Freund and R.E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, August 1997.
14. C. Gentile. The robustness of the p-norm algorithms. Machine Learning, 53(3):265-299, 2003.
15. A. Kalai, A.R. Klivans, Y. Mansour, and R. Servedio. Agnostically learning halfspaces. In Proceedings of the 46th Foundations of Computer Science (FOCS), 2005.
16. A.T. Kalai and R. Sastry. The isotron algorithm: High-dimensional isotonic regression. In Proceedings of the 22th Annual Conference on Learning Theory, 2009.
17. A.R. Klivans, P.M. Long, and R.A. Servedio. Learning halfspaces with malicious noise. The Journal of Machine Learning Research, 10:2715-2740, 2009.
18. P.M. Long and R.A. Servedio. Learning large-margin halfspaces with more malicious noise. In NIPS, 2011.
19. F. Rosenblatt. The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65:386-407, 1958. (Reprinted in Neurocomputing (MIT Press, 1988).).
20. B. Schölkopf and A. J. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization and Beyond. MIT Press, 2002.
21. R.A. Servedio. Smooth boosting and learning with malicious noise. Journal of Machine Learning Research, 4: 633-648, 2003.
22. S. Shalev-Shwartz, O. Shamir, and K. Sridharan. Learning kernel-based halfspaces with the 0-1 loss. SIAM Journal on Computing, 40:1623-1646, 2011.
23. L. G. Valiant. Learning disjunctions of conjunctions. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 560-566, August 1985.
24. V. N. Vapnik. Statistical Learning Theory. Wiley, 1998.
25. T. Zhang. Statistical behavior and consistency of classification methods based on convex risk minimization. The Annals of Statistics, 32:56-85, 2004.