Sciweavers

74
Voted
ECCC
2006

Cryptographic Hardness Results for Learning Intersections of Halfspaces

14 years 10 months ago
Cryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness results are derived from two public-key cryptosystems due to Regev, which are based on the worstcase hardness of well-studied lattice problems. Specifically, we prove that a polynomial-time algorithm for PAC learning intersections of n halfspaces (for a constant > 0) in n dimensions
Adam R. Klivans, Alexander A. Sherstov
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where ECCC
Authors Adam R. Klivans, Alexander A. Sherstov
Comments (0)