Differentially private learning of geometric concepts

Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present differentially private efficient algorithms for learning union of polygons in the plane (which are not necessarily convex). Our algorithms achieve (α,β)-PAC learning and (ϵ,δ)-differential privacy using a sample of size O~(1αϵklogd), where the domain is [d]×[d] and k is the number of edges in the union of polygons.
Original languageEnglish GB
Title of host publicationProceedings of the 36th International Conference on Machine Learning, PMLR
Pages3233-3241
Volume97
StatePublished - 2019

Fingerprint

Dive into the research topics of 'Differentially private learning of geometric concepts'. Together they form a unique fingerprint.

Cite this