Privacy-Preserving Statistical Learning and Testing
- Huanyu Zhang | Microsoft Research
Identity Testing and Distributional Property Learning are two fundamental problems in statistical inference. However, in many settings, data may contain sensitive information about individuals. It is critical that our methods should protect sensitive information, meanwhile not preclude our overall goals of statistical analysis.
In this talk, I will talk about Differentially Private Identity Testing and Distributional Property Learning. We derive almost-tight sample complexity bounds for both problems. Our upper bounds come from privatizing non-private estimators. As to the lower bound, We establish a general coupling method which we believe can be used to obtain strong lower bounds for other statistical problems under privacy.
[Slides]
-
-
Ilya Razenshteyn
Senior Researcher
-
-
Watch Next
-
Network transceiver insertion
- Elliott Hogg,
- Andromachi Chatzieleftheriou
-
Chopstick-Inspired Non-Prehensile Manipulation for Datacenter Automation
- Andromachi Chatzieleftheriou,
- Harshit Khurana,
- Elliott Hogg
-
-
-
-
-
AI, Radio Astronomy, and the Search for Life Beyond Earth
- Ramiro Caisse Saide
-
-
-