PAPRIKA: Private Online False Discovery Rate Control
Wanrong Zhang, Gautam Kamath, Rachel Cummings
Abstract
In hypothesis testing, a false discovery occurs when a hypothesis is incorrectly rejected due to noise in the sample. When adaptively testing multiple hypotheses, the probability of a false discovery increases as more tests are performed. Thus the problem of False Discovery Rate (FDR) control is to find a procedure for testing multiple hypotheses that accounts for this effect in determining the set of hypotheses to reject. The goal is to minimize the number (or fraction) of false discoveries, while maintaining a high true positive rate (i.e., correct discoveries). In this work, we study False Discovery Rate (FDR) control in multiple hypothesis testing under the constraint of differential privacy for the sample. Unlike previous work in this direction, we focus on the online setting, meaning that a decision about each hypothesis must be made immediately after the test is performed, rather than waiting for the output of all tests as in the offline setting. We provide new private algorithms based on state-of-the-art results in non-private online FDR control. Our algorithms have strong provable guarantees for privacy and statistical performance as measured by FDR and power. We also provide experimental results to demonstrate the efficacy of our algorithms in a variety of data environments.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 76a112e0-e2f4-4070-a716-bb1bb3830a19Cited by top-tier papers1
Ask how each one uses itRelated papers
- Locally private online change point detectionThomas Berrett, Yi YuNeurIPS 2021 · 20 citations
- The Limits of Differential Privacy in Online LearningBo Li, Wei Wang, Peng YeNeurIPS 2024 · 9 citations
- A unified framework for bandit multiple testingZiyu Xu, Ruodu Wang, Aaditya RamdasNeurIPS 2021 · 22 citations
- On the Robustness of Bandit Multiple TestingZhengyu Zhou, Weiwei LiuAAAI 2026
- Fast and Near-Optimal Algorithms for Private Hypothesis SelectionHilal Asi, Hongjie ChenICML 2026
