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

Amol Khanna, Edward Raff, Nathan Inkawhich
4/1/2024
cs.LGcs.CRstat.ML

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{khanna2024sok,
  title  = {SoK: A Review of Differentially Private Linear Models For High-Dimensional Data},
  author = {Amol Khanna and Edward Raff and Nathan Inkawhich},
  year   = {2024},
  eprint = {2404.01141},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.01141v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.01141.svg)](https://codeofpaper.com/paper/2404.01141)

Discussion