2025/06/07 by Meng Ding, Tian, Xizhi, Ding, Meng +4 · 1 citation
Computer Science · #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Privacy-Preserving Technologies in Data #Stochastic Gradient Optimization Techniques
paper · pdf · doi:10.48550/arxiv.2506.06861
openalex publication_date 2025/06/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
As a fundamental problem in machine learning and differential privacy (DP), DP linear regression has been extensively studied. However, most existing methods focus primarily on either regular data distributions or low-dimensional cases with irregular data. To address these limitations, this paper provides a comprehensive study of DP sparse linear regression with heavy-tailed responses in high-dimensional settings. In the first part, we introduce the DP-IHT-H method, which leverages the Huber loss and private iterative hard thresholding to achieve an estimation error bound of \( O\biggl( s* (1 )/(2) ⋅ \biggl((log d)/(n)\biggr)^\fracζ1 + ζ + s* (1 + 2ζ)/(2 + 2ζ) ⋅ \biggl((log2 d)/(n ε)\biggr)^\fracζ1 + ζ \biggr) \) under the (ε, δ)-DP model, where n is the sample size, d is the dimensionality, s^* is the sparsity of the parameter, and ζ∈ (0, 1] characterizes the tail heaviness of the data. In the second part, we propose DP-IHT-L, which further improves the error bound under additional assumptions on the response and achieves \( O(\frac(s^*)3/2 log dn ε). \) Compared to the first result, this bound is independent of the tail parameter ζ. Finally, through experiments on synthetic and real-world datasets, we demonstrate that our methods outperform standard DP algorithms designed for ``regular'' data.