Limitations of membership queries in testable learning
From MaRDI portal
Cites work
- 10.1162/153244302760200669
- A moment-matching approach to testable learning and a new characterization of Rademacher complexity
- Complexity theoretic limitations on learning halfspaces
- From average case complexity to improper learning complexity
- scientific article; zbMATH DE number 5957428 (Why is no real title available?)
- scientific article; zbMATH DE number 5485565 (Why is no real title available?)
- Improper learning by refuting
- Learning functions of \(k\) relevant variables
- On the power of membership queries in agnostic learning
- Properly learning decision trees in almost polynomial time
- Selection of relevant features and examples in machine learning
- Separating models of learning with faulty teachers
- Testing distributional assumptions of learning algorithms
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
This page was built for publication: Limitations of membership queries in testable learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445619)