paper-with-me

홈 › Papers

Efficient Testable Learning of General Halfspaces with Adversarial Label Noise

2024-08-30 · Ilias Diakonikolas, Daniel M. Kane, Sihan Liu, Nikos Zarifis

We study the task of testable learning of general -- not necessarily homogeneous -- halfspaces with adversarial label noise with respect to the Gaussian distribution. In the testable learning framework, the goal is to develop a tester-learner such that if the data passes the tester, then one can trust the output of the robust learner on the data.Our main result is the first polynomial time tester-learner for general halfspaces that achieves dimension-independent misclassification error. At the heart of our approach is a new methodology to reduce testable learning of general halfspaces to testable learning of nearly homogeneous halfspaces that may be of broader interest.

📄 PDF Abstract BibTeX arXiv:2408.17165

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Efficient Testable Learning of Halfspaces with Adversarial Label Noise

2023-03-09 · NeurIPS 2023 11

We give the first polynomial-time algorithm for the testable learning of halfspaces in the presence of adversarial label noise under the Gaussian distribution. In the recently introduced testable learning model, one is r…

An Efficient Tester-Learner for Halfspaces

2023-02-28 · Aravind Gollakota, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan

We give the first efficient algorithm for learning halfspaces in the testable learning model recently defined by Rubinfeld and Vasilyan (2023). In this model, a learner certifies that the accuracy of its output hypothesi…

Testable Learning of General Halfspaces under Massart Noise

2026-02-25 · Ilias Diakonikolas, Giannis Iakovidis, Daniel M. Kane, Sihan Liu arxiv

We study the algorithmic task of testably learning general Massart halfspaces under the Gaussian distribution. In the testable learning setting, the aim is the design of a tester-learner pair satisfying the following pro…

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 und…

Testing Noise Assumptions of Learning Algorithms

2025-01-15 · Surbhi Goel, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan

We pose a fundamental question in computational learning theory: can we efficiently test whether a training set satisfies the assumptions of a given noise model? This question has remained unaddressed despite decades of …

Learning Theory