A frequentist local false discovery rate
Daniel Xiang, Jake A. Soloff, William Fithian
TL;DR
The paper introduces a frequentist counterpart to the local false discovery rate (lfdr) that avoids Bayesian priors by defining lfdr(t) as the relative frequency of null statistics at the point t. It proves that this lfdr provides calibrated forecasts and, when used with a threshold at $1/(1+\lambda)$, yields the optimal separable rejection under a weighted loss, while remaining estimable via standard density estimation methods. A novel finite-sample error criterion, the boundary FDR (bFDR), is proposed and controlled by the Support Line (SL) method under independence, linking local lfdr concepts to actionable multiple testing procedures. The approach is demonstrated across three applications—Gaussian graphical models, microbiome data, and aggregate nudges—highlighting calibration advantages and practical utility in settings where Bayesian modeling of dependence or exchangeability is questionable. Overall, the work provides a principled, prior-free framework for locally assessing discovery quality and for conducting multiple testing with finite-sample guarantees, complemented by connections to empirical Bayes techniques and nonparametric density estimation.
Abstract
The local false discovery rate (lfdr) of Efron et al. (2001) enjoys major conceptual and decision-theoretic advantages over the false discovery rate (FDR) as an error criterion in multiple testing, but is only well-defined in Bayesian models where the truth status of each null hypothesis is random. We define a frequentist counterpart to the lfdr based on the relative frequency of nulls at each point in the sample space. The frequentist lfdr is defined without reference to any prior, but preserves several important properties of the Bayesian lfdr: For continuous test statistics, $\text{lfdr}(t)$ gives the probability, conditional on observing some statistic equal to $t$, that the corresponding null hypothesis is true. Evaluating the lfdr at an individual test statistic also yields a calibrated forecast of whether its null hypothesis is true. Finally, thresholding the lfdr at $\frac{1}{1+λ}$ gives the best separable rejection rule under the weighted classification loss where Type I errors are $λ$ times as costly as Type II errors. The lfdr can be estimated efficiently using parametric or non-parametric methods, and a closely related error criterion can be provably controlled in finite samples under independence assumptions. Whereas the FDR measures the average quality of all discoveries in a given rejection region, our lfdr measures how the quality of discoveries varies across the rejection region, allowing for a more fine-grained analysis without requiring the introduction of a prior.
