We provide the first differentially private algorithms for controlling the false discovery rate (FDR) in multiple hypothesis testing, with essentially no loss in power under certain conditions. Our general approach is to adapt a well-known variant of the Benjamini-Hochberg procedure (BHq), making each step differentially private. This destroys the classical proof of FDR control. To prove FDR control of our method we 1. Develop a new proof of the original (non-private) BHq algorithm and its robust variants -a proof requiring only the assumption that the true null test statistics are independent, allowing for arbitrary correlations between the true nulls and false nulls. This assumption is fairly weak compared to those previously shown in the vast literature on this topic, and explains in part the empirical robustness of BHq. 2. Relate the FDR control properties of the differentially private version to the control properties of the non-private version. We also present a low-distortion "one-shot" differentially private primitive for "top k" problems, e.g., "Which are the k most popular hobbies?" (which we apply to: "Which hypotheses have the k most significant p-values?"), and use it to get a faster privacy-preserving instantiation of our general approach at little cost in accuracy. The proof of privacy for the one-shot top k algorithm introduces a new technique of independent interest.
Dwork et al. REF presented a framework for controlling the false discovery rate of a large sequence of hypothesis tests.
Private False Discovery Rate Control
ArXiv
ArXiv
Mathematics Computer Science