Differentially-Private Sublinear-Time Clustering

12/27/2021
by   Jeremiah Blocki, et al.
0

Clustering is an essential primitive in unsupervised machine learning. We bring forth the problem of sublinear-time differentially-private clustering as a natural and well-motivated direction of research. We combine the k-means and k-median sublinear-time results of Mishra et al. (SODA, 2001) and of Czumaj and Sohler (Rand. Struct. and Algorithms, 2007) with recent results on private clustering of Balcan et al. (ICML 2017), Gupta et al. (SODA, 2010) and Ghazi et al. (NeurIPS, 2020) to obtain sublinear-time private k-means and k-median algorithms via subsampling. We also investigate the privacy benefits of subsampling for group privacy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/11/2021

Differentially Private Algorithms for Clustering with Stability Assumptions

We study the problem of differentially private clustering under input-st...
research
06/17/2022

Scalable Differentially Private Clustering via Hierarchically Separated Trees

We study the private k-median and k-means clustering problem in d dimens...
research
12/06/2018

Differentially Private Fair Learning

We design two learning algorithms that simultaneously promise differenti...
research
06/16/2023

A Smooth Binary Mechanism for Efficient Private Continual Observation

In privacy under continual observation we study how to release different...
research
04/23/2020

Deterministic Sparse Sublinear FFT with Improved Numerical Stability

In this paper we extend the deterministic sublinear FFT algorithm for fa...
research
07/08/2021

Locally differentially private estimation of nonlinear functionals of discrete distributions

We study the problem of estimating non-linear functionals of discrete di...
research
06/17/2020

Smoothed Analysis of Online and Differentially Private Learning

Practical and pervasive needs for robustness and privacy in algorithms h...

Please sign up or login with your details

Forgot password? Click here to reset