Reliable agnostic learning

DOI10.1016/J.JCSS.2011.12.026zbMATH Open1244.68066OpenAlexW2069588275MaRDI QIDQ439993FDOQ439993

Authors: Adam Tauman Kalai, Varun Kanade, Yishay Mansour 

Publication date: 17 August 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.12.026

Recommendations

• scientific article; zbMATH DE number 67632
• scientific article; zbMATH DE number 1804109
• Learning reliably and with one-sided error
• Learning in the Presence of Malicious Errors
• Agnostically Learning Halfspaces

zbMATH Keywords

classificationPAC learningagnostic learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• IX. On the problem of the most efficient tests of statistical hypotheses
• Learning Decision Trees Using the Fourier Spectrum
• A theory of the learnable
• Toward efficient agnostic learning
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
• Title not available (Why is that?)
• Agnostically Learning Halfspaces
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• On the use of ROC analysis for the optimization of abstaining classifiers
• A Neyman–Pearson Approach to Statistical Learning

Cited In (6)

• Agnostic Learning in Permutation-Invariant Domains
• Title not available (Why is that?)
• Agnostic Learning from Tolerant Natural Proofs
• Learning reliably and with one-sided error
• Hardness amplification and the approximate degree of constant-depth circuits
• Title not available (Why is that?)

This page was built for publication: Reliable agnostic learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439993)