Differentially Private Nonparametric Regression Under a Growth Condition
Noah Golowich

TL;DR
This paper establishes new conditions under which nonparametric regression hypotheses can be learned privately, relaxing previous restrictive assumptions by introducing a novel filtering technique for stable hypothesis output.
Contribution
It proves that if the scaled fat shattering dimension tends to zero, then nonparametric classes are privately learnable, extending private learnability results to broader classes.
Findings
Private learnability under relaxed growth conditions of the fat shattering dimension.
Introduction of a novel filtering procedure for stable hypothesis output.
First nonparametric private learnability guarantee for diverging fat shattering classes.
Abstract
Given a real-valued hypothesis class , we investigate under what conditions there is a differentially private algorithm which learns an optimal hypothesis from given i.i.d. data. Inspired by recent results for the related setting of binary classification (Alon et al., 2019; Bun et al., 2020), where it was shown that online learnability of a binary class is necessary and sufficient for its private learnability, Jung et al. (2020) showed that in the setting of regression, online learnability of is necessary for private learnability. Here online learnability of is characterized by the finiteness of its -sequential fat shattering dimension, , for all . In terms of sufficient conditions for private learnability, Jung et al. (2020) showed that is privately learnable if…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Advanced Bandit Algorithms Research · Imbalanced Data Classification Techniques
