Emergent Mind
Efficient Private Algorithms for Learning Large-Margin Halfspaces
(1902.09009)
Published Feb 24, 2019
in
cs.LG
,
cs.DS
,
and
stat.ML
Abstract
We present new differentially private algorithms for learning a large-margin halfspace. In contrast to previous algorithms, which are based on either differentially private simulations of the statistical query model or on private convex optimization, the sample complexity of our algorithms depends only on the margin of the data, and not on the dimension. We complement our results with a lower bound, showing that the dependence of our upper bounds on the margin is optimal.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.