All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD1-S5-T4.1
Paper Title Differentially-Private Sublinear-Time Clustering
Authors Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Purdue University, United States
Session D1-S5-T4: Differential Privacy I
Chaired Session: Monday, 12 July, 23:20 - 23:40
Engagement Session: Monday, 12 July, 23:40 - 00:00
Abstract 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.