Principal component analysis in the local differential privacy model
From MaRDI portal
Publication:2290637
DOI10.1016/J.TCS.2019.12.019zbMATH Open1436.68100OpenAlexW2997422449WikidataQ126461507 ScholiaQ126461507MaRDI QIDQ2290637FDOQ2290637
Publication date: 29 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.12.019
Recommendations
- A near-optimal algorithm for differentially-private principal components
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- Smooth sensitivity based approach for differentially private principal component analysis
- On differentially private low rank approximation
- Differentially private high dimensional sparse covariance matrix estimation
Cites Work
- Title not available (Why is that?)
- The Rotation of Eigenvectors by a Perturbation. III
- A useful variant of the Davis-Kahan theorem for statisticians
- Adaptive estimation of a quadratic functional by model selection.
- Sparse PCA: optimal rates and adaptive estimation
- Title not available (Why is that?)
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- On differentially private low rank approximation
- Sparsistency and agnostic inference in sparse PCA
- Minimax sparse principal subspace estimation in high dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotics and concentration bounds for bilinear forms of spectral projectors of sample covariance
- Minimax Optimal Procedures for Locally Private Estimation
- Stochastic Perturbation Theory
- Using principal component analysis to estimate a high dimensional factor model with high-frequency data
- A near-optimal algorithm for differentially-private principal components
- Distributed estimation of principal eigenspaces
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- Smooth sensitivity based approach for differentially private principal component analysis
Cited In (9)
- Differential privacy data publishing method based on the probabilistic principal component analysis
- A near-optimal algorithm for differentially-private principal components
- Differentially-private learning of low dimensional manifolds
- Differentially private high dimensional sparse covariance matrix estimation
- Mitigating the curse of dimensionality in data anonymization
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- Smooth sensitivity based approach for differentially private principal component analysis
- Differentially-private learning of low dimensional manifolds
- Tight lower bound of sparse covariance matrix estimation in the local differential privacy model
Uses Software
This page was built for publication: Principal component analysis in the local differential privacy model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290637)
