Differentially Private High Dimensional Sparse Covariance Matrix Estimation
About
In this paper, we study the problem of estimating the covariance matrix under differential privacy, where the underlying covariance matrix is assumed to be sparse and of high dimensions. We propose a new method, called DP-Thresholding, to achieve a non-trivial $\ell_2$-norm based error bound, which is significantly better than the existing ones from adding noise directly to the empirical covariance matrix. We also extend the $\ell_2$-norm based error bound to a general $\ell_w$-norm based one for any $1\leq w\leq \infty$, and show that they share the same upper bound asymptotically. Our approach can be easily extended to local differential privacy. Experiments on the synthetic datasets show consistent results with our theoretical claims.
Di Wang, Jinhui Xu• 2019
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Sparse PCA | DP Sparse PCA Problem 2 (Model 2) | Sample Complexity Upper Bound2 | 3 | |
| Sparse covariance estimation (Upper Bound) | k-sparse covariance model Problem 1 | Sample Complexity2 | 3 |
Showing 2 of 2 rows