loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)
Learnability and Automatizability
Rome, Italy
October 17-October 19
ISBN: 0-7695-2228-9
ASCII Text
x 
 
Misha Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi, "Learnability and Automatizability," Foundations of Computer Science, IEEE Annual Symposium on, pp. 621-630, 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/FOCS.2004.36,
author = {Misha Alekhnovich and Mark Braverman and Vitaly Feldman and Adam R. Klivans and Toniann Pitassi},
title = {Learnability and Automatizability},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {2004},
issn = {0272-5428},
pages = {621-630},
doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2004.36},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - Learnability and Automatizability
SN - 0272-5428
SP621
EP630
A1 - Misha Alekhnovich,
A1 - Mark Braverman,
A1 - Vitaly Feldman,
A1 - Adam R. Klivans,
A1 - Toniann Pitassi,
PY - 2004
KW - null
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
Misha Alekhnovich, Institute for Advanced Studies
Mark Braverman, University of Toronto
Vitaly Feldman, Harvard University
Adam R. Klivans, Toyota Technological Institute
Toniann Pitassi, Institute for Advanced Studies and University of Toronto

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 PA Clearning algorithm for DNF formulae 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 = RP. 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 \ell \geqslant 2 halfspaces by the intersection of k halfspaces for any constant k ≥ 0. Previous work held for the case when k = \ell.
  • Assuming that NP ⊈ DTIME(2^{n^\varepsilon } ) for a certain constant ε < 1 we show that it is not possible to learn size s decision trees by size s^k decision trees for any k ≥ 0. Previous hardness results for learning decision trees held for k ≤ 2.
  • We present the first non-trivial upper bounds on properly learning DNF formulae and decision trees. In particular we show how to learn size s DNF by DNF in time 2^{\widetilde0} ^{^{(\sqrt {n\log s} } ^) }, and how to learn size s decision trees by decision trees in time n^{0(\log s)}.

    • The hardness results for DNF formulae 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.

    Citation:
    Misha Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi, "Learnability and Automatizability," focs, pp.621-630, 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), 2004
    Usage of this product signifies your acceptance of the Terms of Use.