704 search results - page 1 / 141 » Improved Learning of AC0 Functions |
COLT
1991
Springer
13 years 8 months ago
1991
Springer
Two extensions of the Linial, Mansour, Nisan AC0 learning algorithm are presented. The LMN method works when input examples are drawn uniformly. The new algorithmsimprove on their...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
FOCS
2007
IEEE
13 years 9 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
STOC
1994
ACM
13 years 9 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
SIAMCOMP
2010
13 years 3 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...