Sciweavers

2 search results - page 1 / 1
» Lower Bounds and Hardness Amplification for Learning Shallow...
Sort
View
ECCC
2010
124views more  ECCC 2010»
13 years 11 months ago
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 bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
FOCS
1999
IEEE
14 years 3 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio