The complexity of properly learning simple concept classes
We consider the complexity of properly learning concept classes, i.e. when the learner must output a hypothesis of the same form as the unknown concept. We present the following new upper and lower bounds on well-known concept classes: We show that unless NP = RP, there is no polynomial-time PAC learning algorithm for DNF formulas where the hypothesis is an OR-of-thresholds. Note that as special cases, we show that neither DNF nor OR-of-thresholds are properly learnable unless NP = FIR Previous hardness results have required strong restrictions on the size of the output DNF formula. We also prove that it is NP-hard to learn the intersection of l >= 2 halfspaces by the intersection of k halfspaces for any constant k >= 0. Previous work held for the case when k = l. Assuming that NP not subset of DTIME(2 ''(is an element of)) for a certain constant is an element of  = 0. Previous hardness results for learning decision trees held for k <= 2. We present the first non-trivial upper bounds on properly learning DNF formulas. More specifically, we show how to learn size s DNF by DNF in time 2(O(root n logx)). The hardness results for DNF formulas and intersections of halfspaces are obtained via specialized graph products for amplifying the hardness of approximating the chromatic number as well as applying recent work on the hardness of approximate hypergraph coloring. The hardness results for decision trees, as well as the new upper bounds, are obtained by developing a connection between automatizability in proof complexity and learnability, which may have other applications. (c) 2007 Elsevier Inc. All rights reserved.
pac learning dnf formulas decision trees intersections of halfspaces automatizability proof complexity proper learning hardness of learning