Learning an Intersection of k Halfspaces over a Uniform Distribution


We present a polynomial-time algorithm to learn an intersection of a constant number of halfspaces in n dimensions, over the uniform distribution on an n-dimensional ball. The algorithm we present in fact can learn an intersection of an arbitrary (polynomial) number of halfspaces over this distribution, if the subspace spanned by the normal vectors to the… (More)
DOI: 10.1109/SFCS.1993.366856


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics