SoK: A Review of Differentially Private Linear Models For High-Dimensional Data

April 01, 2024 Β· The Cartographer Β· πŸ› 2024 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML)

πŸ“š THE CARTOGRAPHER: The Cartographer
Survey/review paper β€” maps the landscape rather than implementing a method.

"No code URL or promise found in abstract"
"Title-pattern auto-detect: SoK: A Review of Differentially Private Linear Models For High-Dimensional Data"

Evidence collected by the PWNC Scanner

Authors Amol Khanna, Edward Raff, Nathan Inkawhich arXiv ID 2404.01141 Category cs.LG: Machine Learning Cross-listed cs.CR, stat.ML Citations 5 Venue 2024 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML) Last Checked 1 day ago
Abstract
Linear models are ubiquitous in data science, but are particularly prone to overfitting and data memorization in high dimensions. To guarantee the privacy of training data, differential privacy can be used. Many papers have proposed optimization techniques for high-dimensional differentially private linear models, but a systematic comparison between these methods does not exist. We close this gap by providing a comprehensive review of optimization methods for private high-dimensional linear models. Empirical tests on all methods demonstrate robust and coordinate-optimized algorithms perform best, which can inform future research. Code for implementing all methods is released online.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Machine Learning