We give a new algorithm for learning intersections of halfspaces with a margin, i.e. under the assumption that no example lies too close to any separating hyperplane. Our algorithm combines random projection techniques for dimensionality reduction, polynomial threshold function constructions, and kernel methods. The algorithm is fast and simple. It learns a broader class of functions and achieves an exponential runtime improvement compared with previous work on learning intersections of halfspaces with a margin.
CITATION STYLE
Klivans, A. R., & Servedio, R. A. (2004). Learning intersections of halfspaces with a margin. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3120, pp. 348–362). Springer Verlag. https://doi.org/10.1007/978-3-540-27819-1_24
Mendeley helps you to discover research relevant for your work.