Differentially Private Bayesian Inference for Gaussian Copula Correlations
Shuo Wang, Joseph Feldman, Jerome P. Reiter

TL;DR
This paper introduces differentially private algorithms for estimating Gaussian copula correlations by adding noise to median-based counts and deriving posterior distributions, enabling privacy-preserving multivariate analysis.
Contribution
It presents novel algorithms that ensure differential privacy in Gaussian copula correlation estimation, including a Bayesian posterior approach and a maximum likelihood method.
Findings
Bayesian method accurately estimates correlations with privacy guarantees.
Maximum likelihood approach provides reliable point estimates.
Simulation studies show improved performance over existing methods.
Abstract
Gaussian copulas are widely used to estimate multivariate distributions and relationships. We present algorithms for estimating Gaussian copula correlations that ensure differential privacy. We first convert data values into sets of two-way tables of counts above and below marginal medians. We then add noise to these counts to satisfy differential privacy. We utilize the one-to-one correspondence between the true counts and the copula correlation to estimate a posterior distribution of the copula correlation given the noisy counts, marginalizing over the distribution of the underlying true counts using a composite likelihood. We also present an alternative, maximum likelihood approach for point estimation. Using simulation studies, we compare these methods to extant methods in the literature for computing differentially private copula correlations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Probability and Risk Models · Statistical Methods and Inference
