Learning with symmetric label noise: The importance of being unhinged

Advances in Neural Information Processing Systems

Volumn 2015-January, Issue , 2015, Pages 10-18

  Van Rooyen, Brendan ^a,b   Menony, Aditya Krishna ^a,b   Williamson, Robert C ^a,b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE;

BINARY CLASSIFICATION; CLASSIFICATION PERFORMANCE; LIMITING SOLUTIONS; LINEAR FUNCTIONS; MINIMISATION; REGULARISATION;

EQUIVALENCE CLASSES;

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

References (27)

1. Dana Angluin and Philip Laird. Learning from noisy examples. Machine Learning, 2(4):343-370, 1988.
2. Peter L. Bartlett, Michael I. Jordan, and Jon D. McAuliffe. Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101(473):138-156, 2006.
3. Christopher M Bishop. Pattern Recognition and Machine Learning. Springer-Verlag New York, Inc., 2006.
4. Avrim Blum and Tom Mitchell. Combining labeled and unlabeled data with co-training. In Conference on Computational Learning Theory (COLT), pages 92-100, 1998.
5. Vasil Denchev, Nan Ding, Hartmut Neven, and S. V. N. Vishwanathan. Robust classification with adiabatic quantum optimization. In International Conference on Machine Learning (ICML), pages 863-870, 2012.
6. Luc Devroye, László Györfi, and Gábor Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, 1996.
7. Nan Ding and S. V. N. Vishwanathan. t-logistic regression. In Advances in Neural Information Processing Systems (NIPS), pages 514-522. Curran Associates, Inc., 2010.
8. Thomas S. Ferguson. Mathematical Statistics: A Decision Theoretic Approach. Academic Press, 1967.
9. Aritra Ghosh, Naresh Manwani, and P. S. Sastry. Making risk minimization tolerant to label noise. Neurocomputing, 160:93-107, 2015.
10. Trevor Hastie, Saharon Rosset, Robert Tibshirani, and Ji Zhu. The entire regularization path for the support vector machine. Journal of Machine Learning Research, 5:1391-1415, December 2004. ISSN 1532-4435.
11. Michael Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 5(6):392-401, November 1998.
12. Philip M. Long and Rocco A. Servedio. Random classification noise defeats all convex potential boosters. Machine Learning, 78(3):287-304, 2010. ISSN 0885-6125.
13. Christopher D. Manning, Prabhakar Raghavan, and Hinrich Schütze. Introduction to Information Retrieval. Cambridge University Press, New York, NY, USA, 2008. ISBN 0521865719, 9780521865715.
14. Naresh Manwani and P. S. Sastry. Noise tolerance under risk minimization. IEEE Transactions on Cybernetics, 43(3):1146-1151, June 2013.
15. Hamed Masnadi-Shirazi, Vijay Mahadevan, and Nuno Vasconcelos. On the design of robust classifiers for computer vision. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2010.
16. Nagarajan Natarajan, Inderjit S. Dhillon, Pradeep D. Ravikumar, and Ambuj Tewari. Learning with noisy labels. In Advances in Neural Information Processing Systems (NIPS), pages 1196-1204, 2013.
17. Ali Rahimi and Benjamin Recht. Random features for large-scale kernel machines. In Advances in Neural Information Processing Systems (NIPS), pages 1177-1184, 2007.
18. Mark D. Reid and Robert C. Williamson. Composite binary losses. Journal of Machine Learning Research, 11:2387-2422, December 2010.
19. Mark D Reid and Robert C Williamson. Information, divergence and risk for binary experiments. Journal of Machine Learning Research, 12:731-817, Mar. 2011.
20. Bernhard Schölkopf and Alexander J Smola. Learning with kernels, volume 129. MIT Press, 2002.
21. Rocco A. Servedio. On PAC learning using Winnow, Perceptron, and a Perceptron-like algorithm. In Conference on Computational Learning Theory (COLT), 1999.
22. John Shawe-Taylor and Nello Cristianini. Kernel Methods for Pattern Analysis. Cambridge Uni. Press, 2004.
23. Alex Smola, Arthur Gretton, Le Song, and Bernhard Schölkopf. A Hilbert space embedding for distributions. In Algorithmic Learning Theory (ALT), 2007.
24. Bharath K. Sriperumbudur, Kenji Fukumizu, Arthur Gretton, Gert R. G. Lanckriet, and Bernhard Schölkopf. Kernel choice and classifiability for RKHS embeddings of probability distributions. In Advances in Neural Information Processing Systems (NIPS), 2009.
25. Guillaume Stempfel and Liva Ralaivola. Learning SVMs from sloppily labeled data. In Artificial Neural Networks (ICANN), volume 5768, pages 884-893. Springer Berlin Heidelberg, 2009.
26. Robert Tibshirani, Trevor Hastie, Balasubramanian Narasimhan, and Gilbert Chu. Diagnosis of multiple cancer types by shrunken centroids of gene expression. Proceedings of the National Academy of Sciences, 99(10):6567-6572, 2002.
27. Oscar Wilde. The Importance of Being Earnest, 1895.