Reliable agnostic learning

COLT 2009 - The 22nd Conference on Learning Theory

Volumn , Issue , 2009, Pages

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

^a MICROSOFT RESEARCH   (United Kingdom)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

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

DIAGNOSIS;

FORECASTING;

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

References (14)

1. A. Cannon, J. Howse, D. Hush, and C. Scovel. Learning with the neyman-pearson and min-max criteria. Technical Report LA-UR-02-2951, Los Alamos National Laboratory, 2002.
2. C. Elkan. The foundations of cost-sensitive learning. In Proceedings of the seventeenth International Joint Conference on Artificial Intelligence, pages 973-978, 2001.
3. C. Ferri, P. Flach, and J. Hernández-Orallo. Delegating classifier. In ICML'04: Proceedings of the twenty-first International Conference on Machine Learning, pages 37-44, New York, NY, USA, 2004. ACM.
4. C. Ferri and J. Hernández-Orallo. Cautious classifiers. In Proceedings of first International Workshop on the ROC Analysis in Artificial Intelligence, pages 27-36, 2004.
5. P. Gopalan, A.T. Kalai, and A.R. Klivans. Agnostically learning decision trees. In STOC'08: Proceedings of the fortieth annual ACM Symposium on the Theory of Computation, New York, NY, USA, 2008. ACM.
6. D. Haussler. Decision-theoretic generalizations of the PAC model for neural networks and other applications. Information and Computation, 100: 78-150, 1992.
7. J.C. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 55(3): 414-440, 1997.
8. A.T. Kalai, A.R. Klivans, Y. Mansour, and R.A. Servedio. Agnostically learning halfspaces. In FOCS'05: Proceedings of the 46th annual IEEE Symposium on Foundations of Computer Science, pages 11-20, Washington, DC, USA, 2005. IEEE Computer Society.
9. M.J. Kearns, R.E. Schapire, and L.M. Sellie. Toward efficient agnostic learning. Machine Learning, 17(2): 115-141, 1994.
10. J. Neyman and E. S. Pearson. On the problem of the most efficient tests for statistical hypotheses. Philosophical Transactions of the Royal Society of London, Series A, Containing Papers of a Mathematical or Physical Character, 231: 289-337, 1933.
11. Tadeusz Pietraszek. On the use of roc analysis for the optimization of abstaining classifiers. Machine Learning, 68(2): 137-169, 2007.
12. C. Scott and R. Nowak. A neyman-pearson approach to statistical learning. IEEE Transactions on Information Theory, 51(11): 3806-3819, 2005.
13. L.G. Valiant. A theory of the learnable. Communications of the ACM, 27(11): 1134-1142, 1984.
14. B. Zadrozny, J. Langford, and N. Abe. Cost-sensitive learning by cost-proportionate example weighting. In ICDM'03: Proceeding of the third IEEE International Conference on Data Mining, page 435, Washington, DC, USA, 2003. IEEE Computer Society.