Corpus ID: 201668785

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

@article{Diakonikolas2019NearlyTB,
  title={Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin},
  author={Ilias Diakonikolas and D. Kane and Pasin Manurangsi},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.11335}
}
  • Ilias Diakonikolas, D. Kane, Pasin Manurangsi
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • We study the problem of {\em properly} learning large margin halfspaces in the agnostic PAC model. In more detail, we study the complexity of properly learning $d$-dimensional halfspaces on the unit ball within misclassification error $\alpha \cdot \opt_{\gamma} + \eps$, where $\opt_{\gamma}$ is the optimal $\gamma$-margin error rate and $\alpha \geq 1$ is the approximation ratio. We give learning algorithms and computational hardness results for this problem, for all values of the… CONTINUE READING
    Efficient active learning of sparse halfspaces with arbitrary bounded noise
    3
    Approximation Schemes for ReLU Regression
    3
    Calibrated Surrogate Losses for Adversarially Robust Classification
    2
    Efficiently Learning Adversarially Robust Halfspaces with Noise
    2
    Generalized Resilience and Robust Statistics
    6
    Grinding the Space: Learning to Classify Against Strategic Agents
    1
    Calibrated Surrogate Losses for Adversarially Robust Classification

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 61 REFERENCES