English

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

Machine Learning 2024-04-02 v1 Cryptography and Security Machine Learning

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.

Keywords

Cite

@article{arxiv.2404.01141,
  title  = {SoK: A Review of Differentially Private Linear Models For High-Dimensional Data},
  author = {Amol Khanna and Edward Raff and Nathan Inkawhich},
  journal= {arXiv preprint arXiv:2404.01141},
  year   = {2024}
}

Comments

21 pages, 7 figures. To be published at the 2nd IEEE Conference on Secure and Trustworthy Machine Learning (SaTML)

R2 v1 2026-06-28T15:40:18.618Z