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
Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph
BridgePure: Limited Protection Leakage Can Break Black-Box Data Protection
On the Learnability of Distribution Classes with Adaptive Adversaries
Not All Samples Are Equal: Quantifying Instance-level Difficulty in Targeted Data Poisoning
Machine Unlearning Fails to Remove Data Poisoning Attacks
Cite
×