Open Problem: The Statistical Query Complexity of Learning Sparse Halfspaces

Vitaly Feldman

Abstract: We consider the long-open problem of attribute-efficient learning of halfspaces. In this problem the learner is given random examples labeled by an unknown halfspace function f on \mathbbR^n. Furth...