Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin

Ilias Diakonikolas, Daniel Kane, Pasin Manurangsi

Feb-11-2026, 21:24:18 GMT–Neural Information Processing Systems

On the positive side, we give anα = 1.01-approximate proper learner that uses O(1/( 2γ2)) samples (which is optimal) and runs in timepoly(d/) 2 O(1/γ

algorithm, artificial intelligence, machine learning, (18 more...)

Neural Information Processing Systems

Feb-11-2026, 21:24:18 GMT

Conferences PDF

Country:
- Africa > Sudan (0.04)
- North America
  - Canada > British Columbia
    - Metro Vancouver Regional District > Vancouver (0.04)
  - United States > Arizona
    - Maricopa County > Phoenix (0.04)

Technology:
- Information Technology > Artificial Intelligence > Machine Learning (1.00)

Duplicate Docs Excel Report

Title
Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin

Similar Docs Excel Report more

Title	Similarity	Source
None found