PAPRIKA: Private Online False Discovery Rate Control
Wanrong Zhang, Gautam Kamath, Rachel Cummings
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Locally private online change point detectionThomas Berrett, Yi YuNeurIPS 2021 · 被引用 20 次
- The Limits of Differential Privacy in Online LearningBo Li, Wei Wang, Peng YeNeurIPS 2024 · 被引用 9 次
- A unified framework for bandit multiple testingZiyu Xu, Ruodu Wang, Aaditya RamdasNeurIPS 2021 · 被引用 22 次
- On the Robustness of Bandit Multiple TestingZhengyu Zhou, Weiwei LiuAAAI 2026
- Fast and Near-Optimal Algorithms for Private Hypothesis SelectionHilal Asi, Hongjie ChenICML 2026
