Learning intersections of halfspaces with a margin |
| |
Authors: | Adam R Klivans Rocco A Servedio |
| |
Affiliation: | 1. Department of Computer Science, University of Texas at Austin, Austin, TX 78712, USA;2. Department of Computer Science, Columbia University, New York, NY 10027, USA |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|