We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statistical-query algorithm for learning the intersection of √ n halfspaces in n dimensions must make 2 √ n) queries. This is the first non-trivial lower bound on the statistical query… (More)

### Presentations referencing similar topics