paper-with-me

홈 › Papers

Differentially Private Learning Beyond the Classical Dimensionality Regime

2024-11-20 · Cynthia Dwork, Pranay Tankala, Linjun Zhang

We initiate the study of differentially private learning in the proportional dimensionality regime, in which the number of data samples $n$ and problem dimension $d$ approach infinity at rates proportional to one another, meaning that $d/n\to\delta$ as $n\to\infty$ for an arbitrary, given constant $\delta\in(0,\infty)$. This setting is significantly more challenging than that of all prior theoretical work in high-dimensional differentially private learning, which, despite the name, has assumed that $\delta = 0$ or is sufficiently small for problems of sample complexity $O(d)$, a regime typically considered "low-dimensional" or "classical" by modern standards in high-dimensional statistics. We provide sharp theoretical estimates of the error of several well-studied differentially private algorithms for robust linear regression and logistic regression, including output perturbation, objective perturbation, and noisy stochastic gradient descent, in the proportional dimensionality regime. The $1+o(1)$ factor precision of our error estimates enables a far more nuanced understanding of the price of privacy of these algorithms than that afforded by existing, coarser analyses, which are essentially vacuous in the regime we consider. Using our estimates, we discover a previously unobserved "double descent"-like phenomenon in the training error of objective perturbation for robust linear regression. We also identify settings in which output perturbation outperforms objective perturbation on average, and vice versa, demonstrating that the relative performance of these algorithms is less clear-cut than suggested by prior work. To prove our main theorems, we introduce several probabilistic tools that have not previously been used to analyze differentially private learning algorithms, such as a modern Gaussian comparison inequality and recent universality laws with origins in statistical physics.

📄 PDF Abstract BibTeX arXiv:2411.13682

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Methods 이 논문이 사용한 방법론

Linear Regression Linear Regression is a method for modelling a relationship between a dependent variable and independent variables. These models can be fit with numerous approaches. The most…

Similar Papers 제목 키워드 기반

Differentially Private Regression with Unbounded Covariates

2022-02-19 · Jason Milionis, Alkis Kalavasis, Dimitris Fotakis, Stratis Ioannidis

We provide computationally efficient, differentially private algorithms for the classical regression settings of Least Squares Fitting, Binary Regression and Linear Regression with unbounded covariates. Prior to our work…

regression

Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets

2023-05-26 · Yiyun He, Thomas Strohmer, Roman Vershynin, Yizhe Zhu

Differentially private synthetic data provide a powerful mechanism to enable data analysis while protecting sensitive information about individuals. However, when the data lie in a high-dimensional space, the accuracy of…

Representation Transfer for Differentially Private Drug Sensitivity Prediction

2019-01-29 · Teppo Niinimäki, Mikko Heikkilä, Antti Honkela, Samuel Kaski

Motivation: Human genomic datasets often contain sensitive information that limits use and sharing of the data. In particular, simple anonymisation strategies fail to provide sufficient level of protection for genomic da…

BIG-bench Machine LearningCancer type classificationDimensionality ReductionPrediction+2

Differentially Private Prototypes for Imbalanced Transfer Learning

2024-06-12 · Dariush Wahdany, Matthew Jagielski, Adam Dziedzic, Franziska Boenisch

Machine learning (ML) models have been shown to leak private information from their training datasets. Differential Privacy (DP), typically implemented through the differential private stochastic gradient descent algorit…

Transfer Learning

Differentially Private Random Block Coordinate Descent

2024-12-22 · Artavazd Maranjyan, Abdurakhmon Sadiev, Peter Richtárik

Coordinate Descent (CD) methods have gained significant attention in machine learning due to their effectiveness in solving high-dimensional problems and their ability to decompose complex optimization tasks. However, cl…