Improving the Utility of Differentially Private Clustering through Dynamical Processing
Not on the map. Why?
Abstract (arXiv)
This study aims to alleviate the trade-off between utility and privacy of differentially private clustering. Existing works focus on simple methods, which show poor performance for non-convex clusters. To fit complex cluster distributions, we propose sophisticated dynamical processing inspired by Morse theory, with which we hierarchically connect the Gaussian sub-clusters obtained through existing methods. Our theoretical results imply that the proposed dynamical processing introduces little to no additional privacy loss. Experiments show that our framework can improve the clustering performance of existing methods at the same privacy level.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 68 references that are in the map. First posted on arXiv 27 Apr 2023.
Builds on
11 of 68 references.
References · 11
- 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 346
- 2017Differentially Private Mixture of Generative Neural Networkscited by 39
- 2022New Lower Bounds for Private Estimation and a Generalized Fingerprinting Lemmacited by 33
- 2015Differentially Private k-Means Clusteringcited by 27
- 2019Differentially Private Algorithms for Learning Mixtures of Separated Gaussianscited by 27
- 2021Locally Private k-Means in One Roundcited by 19
- 2013An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clusteringcited by 17
- 2021Differentially-Private Clustering of Easy Instancescited by 17
- 2020Federating Recommendations Using Differentially Private Prototypescited by 13
- 2018Possibility results for graph clustering: A novel consistency axiomcited by 6
- 2022Privacy-Preserving Distributed Expectation Maximization for Gaussian Mixture Model using Subspace Perturbationcited by 2
Built on by
Not cited yet.