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)
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Machine Learning
ποΈ
ποΈ
Transcended
ποΈ
ποΈ
Transcended
Continuous control with deep reinforcement learning
π
π
Old Age
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
π
π
Old Age
Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor
π
π
Old Age
SGDR: Stochastic Gradient Descent with Warm Restarts
ποΈ
ποΈ
Transcended