English

False discovery rate smoothing

Methodology 2016-11-15 v2 Applications Computation

Abstract

We present false discovery rate smoothing, an empirical-Bayes method for exploiting spatial structure in large multiple-testing problems. FDR smoothing automatically finds spatially localized regions of significant test statistics. It then relaxes the threshold of statistical significance within these regions, and tightens it elsewhere, in a manner that controls the overall false-discovery rate at a given level. This results in increased power and cleaner spatial separation of signals from noise. The approach requires solving a non-standard high-dimensional optimization problem, for which an efficient augmented-Lagrangian algorithm is presented. In simulation studies, FDR smoothing exhibits state-of-the-art performance at modest computational cost. In particular, it is shown to be far more robust than existing methods for spatially dependent multiple testing. We also apply the method to a data set from an fMRI experiment on spatial working memory, where it detects patterns that are much more biologically plausible than those detected by standard FDR-controlling methods. All code for FDR smoothing is publicly available in Python and R.

Keywords

Cite

@article{arxiv.1411.6144,
  title  = {False discovery rate smoothing},
  author = {Wesley Tansey and Oluwasanmi Koyejo and Russell A. Poldrack and James G. Scott},
  journal= {arXiv preprint arXiv:1411.6144},
  year   = {2016}
}

Comments

Added misspecification analysis, added pathological scenario discussions, additional comparisons, new graph fused lasso algorithm

R2 v1 2026-06-22T07:08:29.470Z