Private Center Points and Learning of Halfspaces

    COLT, pp. 269-282, 2019.

    Cited by: 5|Bibtex|Views4|Links
    EI

    Abstract:

    present a private learner for halfspaces over an arbitrary finite domain $Xsubset mathbb{R}^d$ with sample complexity $mathrm{poly}(d,2^{log^*|X|})$. The building block for this learner is a differentially private algorithm for locating an approximate center point of $mu003emathrm{poly}(d,2^{log^*|X|})$ points -- a high dimensional gener...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments