24 search results - page 5 / 5 » A Query Algorithm for Agnostically Learning DNF |
COLT
2007
Springer
13 years 11 months ago
2007
Springer
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
JMLR
2002
13 years 4 months ago
2002
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...