Hardness of learning noisy halfspaces using polynomial thresholds

07/06/2017

∙

by   Arnab Bhattacharyya, et al.

∙

0

∙

share

We prove the hardness of weakly learning halfspaces in the presence of adversarial noise using polynomial threshold functions (PTFs). In particular, we prove that for any constants d ∈Z^+ and ε > 0, it is NP-hard to decide: given a set of {-1,1}-labeled points in R^n whether (YES Case) there exists a halfspace that classifies (1-ε)-fraction of the points correctly, or (NO Case) any degree-d PTF classifies at most (1/2 + ε)-fraction of the points correctly. This strengthens to all constant degrees the previous NP-hardness of learning using degree-2 PTFs shown by Diakonikolas et al. (2011). The latter result had remained the only progress over the works of Feldman et al. (2006) and Guruswami et al. (2006) ruling out weakly proper learning adversarially noisy halfspaces.