Principal component analysis in the local differential privacy model

Di Wang, Jinhui Xu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

In this paper, we study the Principal Component Analysis (PCA) problem under the (distributed) non-interactive local differential privacy model. For the low dimensional case, we show the optimal ratefor the private minimax risk of the k-dimensional PCA using the squared subspace distance as the measurement. For the high dimensional row sparse case, we first give a lower bound on the private minimax risk, . Then we provide an efficient algorithm to achieve a near optimal upper bound. Experiments on both synthetic and real world datasets confirm the theoretical guarantees of our algorithms.
Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
PublisherInternational Joint Conferences on Artificial IntelligenceThomas.schiex@toulouse.inra.fr
Pages4795-4801
Number of pages7
ISBN (Print)9780999241141
DOIs
StatePublished - Jan 1 2019
Externally publishedYes

Fingerprint

Dive into the research topics of 'Principal component analysis in the local differential privacy model'. Together they form a unique fingerprint.

Cite this