English

Improving the Variance of Differentially Private Randomized Experiments through Clustering

Machine Learning 2025-05-29 v3 Cryptography and Security Machine Learning Methodology

Abstract

Estimating causal effects from randomized experiments is only possible if participants are willing to disclose their potentially sensitive responses. Differential privacy, a widely used framework for ensuring an algorithms privacy guarantees, can encourage participants to share their responses without the risk of de-anonymization. However, many mechanisms achieve differential privacy by adding noise to the original dataset, which reduces the precision of causal effect estimation. This introduces a fundamental trade-off between privacy and variance when performing causal analyses on differentially private data. In this work, we propose a new differentially private mechanism, "Cluster-DP", which leverages a given cluster structure in the data to improve the privacy-variance trade-off. While our results apply to any clustering, we demonstrate that selecting higher-quality clusters, according to a quality metric we introduce, can decrease the variance penalty without compromising privacy guarantees. Finally, we evaluate the theoretical and empirical performance of our Cluster-DP algorithm on both real and simulated data, comparing it to common baselines, including two special cases of our algorithm: its unclustered version and a uniform-prior version.

Keywords

Cite

@article{arxiv.2308.00957,
  title  = {Improving the Variance of Differentially Private Randomized Experiments through Clustering},
  author = {Adel Javanmard and Vahab Mirrokni and Jean Pouget-Abadie},
  journal= {arXiv preprint arXiv:2308.00957},
  year   = {2025}
}

Comments

35 pages, 8 figures, accepted at International Conference on Machine Learning (ICML 2025)

R2 v1 2026-06-28T11:46:09.878Z