Learning Intersections and Thresholds of Halfspaces.
A. Klivans and R. O'Donnell and R. Servedio.
Journal of Computer and System Sciences 68(4), 2004, pp. 808-840 (special issue for FOCS 2002).
Preliminary version in 43rd Annual Symposium on Foundations of Computer Science (FOCS), 2002, pp. 177-186.


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 constant error parameter. We also give the first quasipolynomial time algorithm for learning any Boolean function of a polylog number of polynomial-weight halfspaces under any distribution on the Boolean hypercube. As special cases of these results we obtain algorithms for learning intersections and thresholds of halfspaces. Our uniform distribution learning algorithms involve a novel non-geometric approach to learning halfspaces; we use Fourier techniques together with a careful analysis of the noise sensitivity of functions of halfspaces. Our algorithms for learning under any distribution use techniques from real approximation theory to construct low-degree polynomial threshold functions. Finally, we also observe that any function of a constant number of polynomial-weight halfspaces can be learned in polynomial time in the model of exact learning from membership and equivalence queries.

pdf of conference version

Postscript or pdf of journal version

Back to main papers page