Recommendations
Cites work
- scientific article; zbMATH DE number 5485565 (Why is no real title available?)
- A Neyman–Pearson Approach to Statistical Learning
- A theory of the learnable
- Agnostically Learning Halfspaces
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- IX. On the problem of the most efficient tests of statistical hypotheses
- Learning Decision Trees Using the Fourier Spectrum
- On the use of ROC analysis for the optimization of abstaining classifiers
- Toward efficient agnostic learning
Cited in
(6)- Agnostic Learning in Permutation-Invariant Domains
- scientific article; zbMATH DE number 67632 (Why is no real title available?)
- Agnostic Learning from Tolerant Natural Proofs
- Learning reliably and with one-sided error
- Hardness amplification and the approximate degree of constant-depth circuits
- scientific article; zbMATH DE number 6866335 (Why is no real title available?)
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)