Corpus ID: 211532640

PAPRIKA: Private Online False Discovery Rate Control

  title={PAPRIKA: Private Online False Discovery Rate Control},
  author={Wanrong Zhang and Gautam Kamath and 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… Expand

Figures from this paper


On Online Control of False Discovery Rate
This work is the first that controls FDR in this setting and develops lower bounds on the total discovery rate under the mixture model and proves that both LOND and LORD have nearly linear number of discoveries. Expand
Online Rules for Control of False Discovery Rate and False Discovery Exceedance
A class of "generalized alpha-investing" procedures are studied and it is proved that any rule in this class controls online FDR, provided $p-values corresponding to true nulls are independent from the other $p$-values, as well as a modified set of procedures that also allow to control the false discovery exceedance. Expand
Differentially Private False Discovery Rate Control
This paper proposes the first differentially private procedure for controlling the false discovery rate (FDR) in multiple hypothesis testing and develops a new technique based on a backward submartingale for proving FDR control of a broad class of multiple testing procedures, including the private procedure, and both the BHq step-up and step-down procedures. Expand
Controlling the false discovery rate: a practical and powerful approach to multiple testing
SUMMARY The common approach to the multiplicity problem calls for controlling the familywise error rate (FWER). This approach, though, has faults, and we point out a few. A different approach toExpand
SAFFRON: an adaptive algorithm for online control of the false discovery rate
This work presents a powerful new framework for online FDR control that is seen as an online analogue of the famous offline Storey-BH adaptive procedure, and demonstrates that SAFFRON is also more powerful than its non-adaptive counterparts, such as LORD and other generalized alpha-investing algorithms. Expand
α-investing: a procedure for sequential control of expected false discoveries
"a"-investing is an adaptive sequential methodology that encompasses a large family of procedures for testing multiple hypotheses. All control mFDR, which is the ratio of the expected number of falseExpand
ADDIS: an adaptive discarding algorithm for online FDR control with conservative nulls
A new adaptive discarding method called ADDIS is introduced that provably controls the FDR and achieves the best of both worlds: it enjoys appreciable power increase over all existing methods ifnulls are conservative (the practical case), and rarely loses power if nulls are exactly uniformly distributed (the ideal case). Expand
Calibrating Noise to Sensitivity in Private Data Analysis
The study is extended to general functions f, proving that privacy can be preserved by calibrating the standard deviation of the noise according to the sensitivity of the function f, which is the amount that any single argument to f can change its output. Expand
Differential privacy under continual observation
This work identifies the problem of maintaining a counter in a privacy preserving manner and shows its wide applicability to many different problems. Expand
Generalized α‐investing: definitions, optimality results and application to public databases
type="main" xml:id="rssb12048-abs-0001"> The increasing prevalence and utility of large public databases necessitates the development of appropriate methods for controlling false discovery. MotivatedExpand