Hardness of Learning Halfspaces with Massart Noise

Cited by: 0|Bibtex|Views2

Abstract:

We study the complexity of PAC learning halfspaces in the presence of Massart (bounded) noise. Specifically, given labeled examples $(x, y)$ from a distribution $D$ on $\mathbb{R}^{n} \times \{ \pm 1\}$ such that the marginal distribution on $x$ is arbitrary and the labels are generated by an unknown halfspace corrupted with Massart noi...More

Code:

Data:

Full Text