Aditya Dhar, Jason Huang
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We study differentially private mean estimation in a high-dimensional setting. Existing differential privacy techniques applied to large dimensions lead to computationally intractable problems or estimators with excessive privacy loss. Recent work in high-dimensional robust statistics has identified computationally tractable mean estimation algorithms with asymptotic dimensionindependent error guarantees. We incorporate these results to develop a strict bound on the global sensitivity of the robust mean estimator. This yields a computationally tractable algorithm for differentially private mean estimation in high dimensions with dimension-independent privacy loss. Finally, we show on synthetic data that our algorithm significantly outperforms classic differential privacy methods, overcoming barriers to high-dimensional differential privacy.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.01944")
get_code_for_paper("2006.01944")
have("2006.01944")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.01944.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.01944)
Connect an agent — have() is free.