32 search results - page 4 / 7 » On Learning Random DNF Formulas Under the Uniform Distributi... |
COLT
1995
Springer
13 years 11 months ago
1995
Springer
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
ISTCS
1997
Springer
13 years 11 months ago
1997
Springer
Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this ...
COLT
2001
Springer
14 years 1 days ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
COLT
1999
Springer
13 years 11 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
ECCC
2010
13 years 7 months ago
2010
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...