Agnostic Learning of Monomials by Halfspaces Is Hard.
Vitaly FeldmanVenkatesan GuruswamiPrasad RaghavendraYi WuPublished in: SIAM J. Comput. (2012)
Keyphrases
- agnostic learning
- uniform distribution
- multivariate polynomials
- noise tolerant
- pac learning
- linear threshold functions
- membership queries
- decision lists
- concept class
- term dnf
- target function
- binary classification problems
- concept classes
- learning theory
- low degree
- feature selection
- boosting algorithms
- multi class
- upper bound
- special case
- lower bound
- decision trees