5 search results - page 1 / 1 » Learning Threshold Functions with Small Weights Using Member... |
COLT
1999
Springer
13 years 9 months ago
1999
Springer
We study the learnability of Threshold functions with bounded weights using membership queries only. We show that the class Ct of Threshold functions with positive integer weights...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
ECCC
2007
13 years 4 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...