18/07/2021

Differentially Private Correlation Clustering

Mark Bun, Marek Elias, Janardhan Kulkarni

Keywords: Deep Learning, Embedding Approaches, Algorithms, Representation Learning; Algorithms, Structured Prediction; Applications, Computational Biology and Bioinform, Social Aspects of Machine Learning, Privacy, Anonymity, and Security

Abstract: Correlation clustering is a widely used technique in unsupervised machine learning. Motivated by applications where individual privacy is a concern, we initiate the study of differentially private correlation clustering. We propose an algorithm that achieves subquadratic additive error compared to the optimal cost. In contrast, straightforward adaptations of existing non-private algorithms all lead to a trivial quadratic error. Finally, we give a lower bound showing that any pure differentially private algorithm for correlation clustering requires additive error Ω(n).

 0
 0
 0
 0
This is an embedded video. Talk and the respective paper are published at ICML 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers