Stable Estimators for Fast Private Statistics @GoogleTechTalks
Stable Estimators for Fast Private Statistics  @GoogleTechTalks
Uploaded January 2026 | Updated November 2026, 12 hours ago
A Google TechTalk, 2024-11-13, presented by Gavin Brown
Privacy in ML Seminar. ABSTRACT: The literature on differentially private estimation contains a range of approaches for many fundamental tasks. However, most existing algorithms have significant drawbacks, such as requiring strong prior bounds on the data or suffering in high dimensions. For many problems, the best known algorithms require exponential time. In this talk, we will discuss a new approach that leads to fast and near-optimal private algorithms for mean estimation, covariance estimation, and least squares. The analysis focuses on stabilizing a greedy, but carefully tuned, outlier-removal process.

Based on work with Sam Hopkins, Adam Smith, Jon Hayase, Xiyang Liu, Weihao Kong, Sewoong Oh, and Juan Perdomo. arxiv links: arxiv.org/abs/2301.12250, arxiv.org/abs/2404.15409
Stable Estimators for Fast Private Statistics2022 Blockly Developers Summit: Contributing to BlocklyCharles Hoskinson | CEO of Input Output Global | web3 talks | Apr 4th 2024 | MC: Marlon Ruiz2022 Blockly Developers Summit: Backwards ExecutionPrivacy Amplification for Correlated-Noise Mechanisms via b-Min-Sep SubsamplingCan LLMs Keep a Secret? Testing Privacy Implications of Language ModelsPrivate Adaptations of Large Language ModelsEvan Shapiro | CEO Mina Foundation | web3 talks | Feb 16th 2023 | MC: Marlon RuizA Fast Algorithm for Adaptive Private Mean Estimation
Google TechTalks |

Stable Estimators for Fast Private Statistics

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER