Reliable agnostic learning

Journal of Computer and System Sciences

Volumn 78, Issue 5, 2012, Pages 1481-1495

  Kalai, Adam Tauman ^a   Kanade, Varun ^b   Mansour, Yishay ^c  

^a MICROSOFT RESEARCH   (United Kingdom)

^b HARVARD UNIVERSITY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Agnostic learning; Classification; PAC learning

Indexed keywords

CLASSIFICATION (OF INFORMATION); DIAGNOSIS;

AGNOSTIC LEARNING; FALSE NEGATIVES; FALSE POSITIVE; HALF SPACES; MEMBERSHIP QUERY; NATURAL DISTRIBUTION; PAC LEARNING; SPAM DETECTION;

FORECASTING;

EID: 84861636936     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2011.12.026     Document Type: Conference Paper

References (19)

1. A. Cannon, J. Howse, D. Hush, C. Scovel, Learning with the Neyman-Pearson and min-max criteria, Technical Report LA-UR-02-2951, Los Alamos National Laboratory, 2002.
2. P. Domingos Metacost: A general method for making classifiers cost-sensitive KDD99: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 1999 ACM New York, NY, USA 155 164
3. C. Elkan, The foundations of cost-sensitive learning, in: IJCAI01: Proceedings of the 17th International Joint Conference on Artificial Intelligence, 2001, pp. 973-978.
4. V. Feldman, Distribution-specific agnostic boosting, in: Proceedings of the First Symposium on Innovations in Computer Science10, 2010.
5. C. Ferri, P. Flach, and J. Hernández-Orallo Delegating classifier ICML04: Proceedings of the Twenty-First International Conference on Machine Learning 2004 ACM New York, NY, USA 37 44
6. C. Ferri, J. Hernández-Orallo, Cautious classifiers, in: Proceedings of First International Workshop on the ROC Analysis in Artificial Intelligence, 2004, pp. 27-36.
7. O. Goldreich, L.A. Levin, A hard-core predicate for all one-way functions, 1989, pp. 25-32.
8. P. Gopalan, A.T. Kalai, and A.R. Klivans Agnostically learning decision trees STOC08: Proceedings of the Fortieth Annual ACM Symposium on the Theory of Computation 2008 ACM New York, NY, USA
9. D. Haussler Decision-theoretic generalizations of the PAC model for neural networks and other applications Inform. and Comput. 100 1992 78 150
10. J.C. Jackson An efficient membership-query algorithm for learning DNF with respect to the uniform distribution J. Comput. System Sci. 55 3 1997 414 440
11. A. Kalai, and V. Kanade Potential-based agnostic boosting Adv. Neural Inf. Process. Syst. 22 2009 880 888
12. A.T. Kalai, A.R. Klivans, Y. Mansour, and R.A. Servedio Agnostically learning halfspaces FOCS05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science 2005 IEEE Computer Society Washington, DC, USA 11 20
13. M.J. Kearns, R.E. Schapire, and L.M. Sellie Toward efficient agnostic learning Mach. Learn. 17 2 1994 115 141
14. E. Kushilevitz, and Y. Mansour Learning decision trees using the Fourier spectrum SIAM J. Comput. 22 6 1993 1331 1348
15. J. Neyman, and E.S. Pearson On the problem of the most efficient tests for statistical hypotheses Philos. Trans. R. Soc. Lond. Ser. A Contain. Pap. Math. Phys. Character 231 1933 289 337
16. Tadeusz Pietraszek On the use of ROC analysis for the optimization of abstaining classifiers Mach. Learn. 68 2 2007 137 169
17. C. Scott, and R. Nowak A Neyman-Pearson approach to statistical learning IEEE Trans. Inform. Theory 51 11 2005 3806 3819
18. L.G. Valiant A theory of the learnable Commun. ACM 27 11 1984 1134 1142
19. B. Zadrozny, J. Langford, and N. Abe Cost-sensitive learning by cost-proportionate example weighting ICDM03: Proceeding of the Third IEEE International Conference on Data Mining 2003 IEEE Computer Society Washington, DC, USA 435