Covariance's loss is privacy's gain: computationally efficient, private and accurate synthetic data
From MaRDI portal
Publication:6118081
DOI10.1007/s10208-022-09591-7arXiv2107.05824OpenAlexW3181087951MaRDI QIDQ6118081
Thomas Strohmer, March Boedihardjo, R. V. Vershinin
Publication date: 23 February 2024
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.05824
Cites Work
- Unnamed Item
- Unnamed Item
- A norm compression inequality for block partitioned positive semidefinite matrices
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Efficient \(k\)-anonymous microaggregation of multivariate numerical data via principal component analysis
- Efficient algorithms for privately releasing marginals via convex relaxations
- Faster Algorithms for Privately Releasing Marginals
- PCPs and the Hardness of Generating Private Synthetic Data
- The Algorithmic Foundations of Differential Privacy
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
- PrivBayes
- A learning theory approach to noninteractive database privacy
- On differentially private low rank approximation
This page was built for publication: Covariance's loss is privacy's gain: computationally efficient, private and accurate synthetic data