43 search results - page 1 / 9 » Fooling Functions of Halfspaces under Product Distributions |
COCO
2010
Springer
13 years 9 months ago
2010
Springer
ML
2007
ACM
13 years 4 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
FOCS
2002
IEEE
13 years 10 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...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
CRYPTO
2010
Springer
13 years 2 months ago
2010
Springer
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...