Near Optimal Private and Robust Linear Regression
Not on the map. Why?
Abstract (arXiv)
We study the canonical statistical estimation problem of linear regression from n i.i.d.~examples under (varepsilon,δ)-differential privacy when some response variables are adversarially corrupted. We propose a variant of the popular differentially private stochastic gradient descent (DP-SGD) algorithm with two innovations: a full-batch gradient descent to improve sample complexity and a novel adaptive clipping to guarantee robustness. When there is no adversarial corruption, this algorithm improves upon the existing state-of-the-art approach and achieves a near optimal sample complexity. Under label-corruption, this is the first efficient linear regression algorithm to guarantee both (varepsilon,δ)-DP and robustness. Synthetic experiments confirm the superiority of our approach.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 60 of its 94 references that are in the map. First posted on arXiv 30 Jan 2023.
Builds on
60 of 94 references.
References · 60
- 2016Deep Learning with Differential Privacycited by 2,682
- 2017Renyi Differential Privacycited by 643
- 2013The Composition Theorem for Differential Privacycited by 290
- 2014RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Responsecited by 262
- 2018Subsampled R'enyi Differential Privacy and Analytical Moments Accountantcited by 234
- 2019Differentially Private Learning with Adaptive Clippingcited by 218
- 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
- 2019Private Stochastic Convex Optimization with Optimal Ratescited by 183
- 2021Numerical Composition of Differential Privacycited by 174
- 2020Private Stochastic Convex Optimization: Optimal Rates in Linear Timecited by 152
- 2018Sever: A Robust Meta-Algorithm for Stochastic Optimizationcited by 123
- 2017Finite Sample Differentially Private Confidence Intervalscited by 103
38 more
- 2019Recent Advances in Algorithmic High-Dimensional Robust Statisticscited by 100
- 2017Being Robust (in High Dimensions) Can Be Practicalcited by 83
- 2021Private Stochastic Convex Optimization: Optimal Rates in ℓ1 Geometrycited by 83
- 2021Optimal Accounting of Differential Privacy via Characteristic Functioncited by 83
- 2018Robust Estimation via Robust Gradient Estimationcited by 76
- 2018Efficient Algorithms and Lower Bounds for Robust Linear Regressioncited by 76
- 2018Efficient Algorithms for Outlier-Robust Regressioncited by 72
- 2017List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussianscited by 70
- 2021Robust and Differentially Private Mean Estimationcited by 66
- 2021Differential privacy and robust statistics in high dimensionscited by 64
- 2015Privacy for Free: Posterior Sampling and Stochastic Gradient Monte Carlocited by 61
- 2018Revisiting differentially private linear regression: optimal and adaptive prediction & estimation in unbounded domaincited by 60
- 2017Learning From Noisy Singly-labeled Datacited by 50
- 2021Efficient Mean Estimation with Pure Differential Privacy via a Sum-of-Squares Exponential Mechanismcited by 50
- 2020Robust regression with covariate filtering: Heavy tails and adversarial contaminationcited by 49
- 2021Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Datacited by 47
- 2022Robustness Implies Privacy in Statistical Estimationcited by 47
- 2017Resilience: A Criterion for Learning in the Presence of Arbitrary Outlierscited by 43
- 2017Privacy Loss in Apple's Implementation of Differential Privacy on MacOS 10.12cited by 42
- 2018Moving Beyond Sub-Gaussianity in High-Dimensional Statistics: Applications in Covariance Estimation and Linear Regressioncited by 42
- 2020Robust Linear Regression: Optimal Rates in Polynomial Timecited by 42
- 2019Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detectioncited by 41
- 2015Robust Regression via Hard Thresholdingcited by 39
- 2018High-Dimensional Robust Mean Estimation in Nearly-Linear Timecited by 39
- 2021Private and polynomial time algorithms for learning Gaussians and beyondcited by 39
- 2021Private Robust Estimation by Stabilizing Convex Relaxationscited by 38
- 2019Generalized Resilience and Robust Statisticscited by 37
- 2020Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packingcited by 35
- 2016On the Theory and Practice of Privacy-Preserving Bayesian Data Analysiscited by 34
- 2020Differentially Private Simple Linear Regressioncited by 33
- 2019Outlier-robust estimation of a sparse linear model using ℓ1-penalized Huber's M-estimatorcited by 31
- 2020Optimal Robust Linear Regression in Nearly Linear Timecited by 31
- 2020Robustly Learning any Clusterable Mixture of Gaussianscited by 28
- 2018Robustness of Conditional GANs to Noisy Labelscited by 27
- 2019On Robustness of Principal Component Regressioncited by 27
- 2020Evading Curse of Dimensionality in Unconstrained Private GLMs via Private Gradient Descentcited by 27
- 2022DP-PCA: Statistically Optimal and Differentially Private PCAcited by 24
- 2019Adaptive Hard Thresholding for Near-optimal Consistent Robust Regressioncited by 23
50 most cited of 60 All 60 (JSON)
Built on by
Citing papers per year: 2023: 4; 2024: 1; 2025: 3; 2026: 1.
9 papers.
- 2023DPZero: Private Fine-Tuning of Language Models without Backpropagationcited by 26
- 2023Correlated Noise Provably Beats Independent Noise for Differentially Private Learningcited by 23
- 2024Private Gradient Descent for Linear Regression: Tighter Error Bounds and Instance-Specific Uncertainty Estimationcited by 11
- 2023Improved Analysis of Sparse Linear Regression in Local Differential Privacy Modelcited by 4
- 2025Nearly Optimal Differentially Private ReLU Regressioncited by 3
- 2026Near-Optimal Private Linear Regression via Iterative Hessian Mixingcited by 1
- 2023The Normal Distributions Indistinguishability Spectrum and its Application to Privacy-Preserving Machine Learningcited by 0
- 2025Differentially Private Two-Stage Gradient Descent for Instrumental Variable Regressioncited by 0
- 2025Privately Estimating Black-Box Statisticscited by 0
- 2026Near-Optimal Private Linear Regression via Iterative Hessian Mixing12 Jan 2026
- 2025Privately Estimating Black-Box Statistics30 Sep 2025
- 2025Differentially Private Two-Stage Gradient Descent for Instrumental Variable Regression26 Sep 2025
- 2025Nearly Optimal Differentially Private ReLU Regression8 Mar 2025
- 2024Private Gradient Descent for Linear Regression: Tighter Error Bounds and Instance-Specific Uncertainty Estimation21 Feb 2024
- 2023DPZero: Private Fine-Tuning of Language Models without Backpropagation14 Oct 2023
- 2023Improved Analysis of Sparse Linear Regression in Local Differential Privacy Model11 Oct 2023
- 2023Correlated Noise Provably Beats Independent Noise for Differentially Private Learning10 Oct 2023
- 2023The Normal Distributions Indistinguishability Spectrum and its Application to Privacy-Preserving Machine Learning3 Sep 2023