Corpus ID: 229297956

# Hardness of Learning Halfspaces with Massart Noise

@article{Diakonikolas2020HardnessOL,
title={Hardness of Learning Halfspaces with Massart Noise},
author={Ilias Diakonikolas and D. Kane},
journal={ArXiv},
year={2020},
volume={abs/2012.09720}
}
• Published 2020
• Computer Science, Mathematics
• ArXiv
• 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 noise at rate $\eta<1/2$, we want to compute a hypothesis with small misclassification error. Characterizing the efficient learnability of halfspaces in the Massart… CONTINUE READING
2 Citations

#### References

SHOWING 1-10 OF 71 REFERENCES
Learning Halfspaces with Tsybakov Noise
• Computer Science, Mathematics
• ArXiv
• 2020
• 6
• PDF
Hardness of Learning Halfspaces with Noise
• Mathematics, Computer Science
• 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
• 2006
• 76
• PDF
Efficient Learning of Linear Separators under Bounded Noise
• Mathematics, Computer Science
• COLT
• 2015
• 54
• PDF