mlsanityData to 7 Oct 2026

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

arXiv 2007.15220 ↗First posted 30 Jul 2020cs.LG cs.CC cs.DScited by 15

Not on the map. Why?

Abstract (arXiv)

We study the computational complexity of adversarially robust proper learning of halfspaces in the distribution-independent agnostic PAC model, with a focus on Lp perturbations. We give a computationally efficient learning algorithm and a nearly matching computational hardness result for this problem. An interesting implication of our findings is that the L∞ perturbations case is provably computationally harder than the case 2 ≤ p < ∞.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 6; 2023: 1; 2024: 1; 2025: 2.

15 papers.

Sort: