The Salon
The Salon
Home
People
Publications
Funding
Opportunities
Light
Dark
Automatic
On the Sample Complexity of Privately Learning Unbounded High-Dimensional Gaussians
Ishaq Aden-Ali
,
Hassan Ashtiani
,
Gautam Kamath
March 2021
PDF
Cite
Type
Conference paper
Publication
Proceedings of the 32nd International Conference on Algorithmic Learning Theory (ALT 2021)
Related
PAPRIKA: Private Online False Discovery Rate Control
Remember What You Want to Forget: Algorithms for Machine Unlearning
Private Hypothesis Selection
Enabling Fast Differentially Private SGD via Just-in-Time Compilation and Vectorization
Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning
Cite
×