Name
Abstract | ||
|---|---|---|
Principal components analysis (PCA) is a standard tool for identifying good low-dimensional approximations to data sets in high dimension. Many current data sets of interest contain private or sensitive information about individuals. Algorithms which operate on such data should be sensitive to the privacy risks in publishing their outputs. Differential privacy is a framework for developing tradeoffs between privacy and the utility of these outputs. In this paper we investigate the theory and empirical performance of differentially private approximations to PCA and propose a new method which explicitly optimizes the utility of the output. We demonstrate that on real data, there this a large performance gap between the existing methods and our method. We show that the sample complexity for the two procedures differs in the scaling with the data dimension, and that our method is nearly optimal in terms of this scaling. |
Year | Venue | Field |
|---|---|---|
2012 | NIPS | Data mining,Mathematical optimization,Data set,Differential privacy,Computer science,Sample complexity,Information sensitivity,Scaling,Performance gap,Principal component analysis |
DocType | Citations | PageRank |
Conference | 32 | 1.19 |
References | Authors | |
23 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kamalika Chaudhuri | 1 | 1503 | 96.90 |
| Anand D. Sarwate | 2 | 615 | 47.82 |
| Kaushik Sinha | 3 | 244 | 17.81 |