paper-with-me

Papers

Efficiently Learning Adversarially Robust Halfspaces with Noise

2020-05-15 · ICML 2020 1 · Omar Montasser, Surbhi Goel, Ilias Diakonikolas, Nathan Srebro

We study the problem of learning adversarially robust halfspaces in the distribution-independent setting. In the realizable setting, we provide necessary and sufficient conditions on the adversarial perturbation sets under which halfspaces are efficiently robustly learnable. In the presence of random label noise, we give a simple computationally efficient algorithm for this problem with respect to any $\ell_p$-perturbation.

📄 PDF Abstract BibTeX arXiv:2005.07652

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise

2020-07-30 · NeurIPS 2020 12 · Ilias Diakonikolas, Daniel M. Kane, Pasin Manurangsi

We study the computational complexity of adversarially robust proper learning of halfspaces in the distribution-independent agnostic PAC model, with a focus on $L_p$ perturbations. We give a computationally efficient lea…

Provable Robustness of Adversarial Training for Learning Halfspaces with Noise

2021-04-19 · Difan Zou, Spencer Frei, Quanquan Gu

We analyze the properties of adversarial training for learning adversarially robust halfspaces in the presence of agnostic label noise. Denoting $\mathsf{OPT}_{p,r}$ as the best robust classification error achieved by a …

ClassificationGeneral ClassificationRobust classification

Robust learning of halfspaces under log-concave marginals

2025-05-19 · Jane Lange, Arsen Vasilyan

We say that a classifier is \emph{adversarially robust} to perturbations of norm $r$ if, with high probability over a point $x$ drawn from the input distribution, there is no point within distance $\le r$ from $x$ that i…

regressionSensitivity

Robust and Private Learning of Halfspaces

2020-11-30 · Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Thao Nguyen

In this work, we study the trade-off between differential privacy and adversarial robustness under L2-perturbations in the context of learning halfspaces. We prove nearly tight bounds on the sample complexity of robust p…

Adversarial Robustness

Learning Geometric Concepts with Nasty Noise

2017-07-05 · Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart

We study the efficient learnability of geometric concept classes - specifically, low-degree polynomial threshold functions (PTFs) and intersections of halfspaces - when a fraction of the data is adversarially corrupted. …

LEMMAOutlier DetectionPAC learning