Near-Optimal Correlation Clustering with Privacy
Abstract
Correlation clustering is a central problem in unsupervised learning, with applications spanning community detection, duplicate detection, automated labeling and many more. In the correlation clustering problem one receives as input a set of nodes and for each node a list of co-clustering preferences, and the goal is to output a clustering that minimizes the disagreement with the specified nodes' preferences. In this paper, we introduce a simple and computationally efficient algorithm for the correlation clustering problem with provable privacy guarantees. Our additive error is stronger than those obtained in prior work and is optimal up to polylogarithmic factors for fixed privacy parameters.
Cite
Text
Cohen-Addad et al. "Near-Optimal Correlation Clustering with Privacy." Neural Information Processing Systems, 2022.Markdown
[Cohen-Addad et al. "Near-Optimal Correlation Clustering with Privacy." Neural Information Processing Systems, 2022.](https://mlanthology.org/neurips/2022/cohenaddad2022neurips-nearoptimal-a/)BibTeX
@inproceedings{cohenaddad2022neurips-nearoptimal-a,
title = {{Near-Optimal Correlation Clustering with Privacy}},
author = {Cohen-Addad, Vincent and Fan, Chenglin and Lattanzi, Silvio and Mitrovic, Slobodan and Norouzi-Fard, Ashkan and Parotsidis, Nikos and Tarnawski, Jakub M},
booktitle = {Neural Information Processing Systems},
year = {2022},
url = {https://mlanthology.org/neurips/2022/cohenaddad2022neurips-nearoptimal-a/}
}