mlsanityData to 7 Oct 2026

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

arXiv 2404.01141 ↗First posted 1 Apr 2024cs.LG cs.CR stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 26 of its 66 references that are in the map. First posted on arXiv 1 Apr 2024.

Builds on

26 of 66 references.

References · 26

  1. 2016Deep Learning with Differential Privacycited by 2,682
  2. 2021Convex optimizationcited by 2,479
  3. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
  4. 2014OpenML: networked science in machine learningcited by 523
  5. 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 339
  6. 2013The Composition Theorem for Differential Privacycited by 290
  7. 2015Coordinate Descent Algorithmscited by 218
  8. 2017A Rewriting System for Convex Optimization Problemscited by 178
  9. 2015Best Subset Selection via a Modern Optimization Lenscited by 99
  10. 2021Private Stochastic Convex Optimization: Optimal Rates in ℓ1 Geometrycited by 83
  11. 2014Private Learning and Sanitization: Pure vs. Approximate Differential Privacycited by 62
  12. 2017Regularizing Deep Neural Networks by Noise: Its Interpretation and Optimizationcited by 56
14 more
  1. 2014On Iterative Hard Thresholding Methods for High-dimensional M-Estimationcited by 53
  2. 2021Non-Euclidean Differentially Private Stochastic Convex Optimization: Optimal Rates in Linear Timecited by 51
  3. 2021High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Datacited by 42
  4. 2021Differential Privacy in the Shuffle Model: A Survey of Separationscited by 14
  5. 2017Collect at Once, Use Effectively: Making Non-interactive Locally Private Learning Possiblecited by 12
  6. 2023On the Efficacy of Differentially Private Few-shot Image Classificationcited by 12
  7. 2023Scaling Up Differentially Private LASSO Regularized Logistic Regression via Faster Frank-Wolfe Iterationscited by 8
  8. 2023The Challenge of Differentially Private Screening Rulescited by 6
  9. 2019Differential Privacy for Sparse Classification Learningcited by 5
  10. 2019A Knowledge Transfer Framework for Differentially Private Sparse Learningcited by 5
  11. 2022Private Federated Statistics in an Interactive Settingcited by 5
  12. 2022High-Dimensional Private Empirical Risk Minimization by Greedy Coordinate Descentcited by 4
  13. 2023Probing the Transition to Dataset-Level Privacy in ML Models Using an Output-Specific and Data-Resolved Privacy Profilecited by 3
  14. 2023A novel analysis of utility in privacy pipelines, using Kronecker products and quantitative information flowcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 1; 2026: 1.

5 papers.