Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PAC LEARNING, SQ-DIM, AMPLIFICATION OF HARDNESS:
Reports tagged with PAC Learning, SQ-DIM, Amplification of Hardness:
TR10-022 | 23rd February 2010
Vitaly Feldman, Homin Lee, Rocco Servedio

Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas

Much work has been done on learning various classes of ``simple'' monotone functions under the uniform distribution. In this paper we give the first unconditional lower bounds for learning problems of this sort by showing that polynomial-time algorithms cannot learn constant-depth monotone Boolean formulas under the uniform distribution in the ... more >>>




ISSN 1433-8092 | Imprint