False Discovery Rate Smoothing

From MaRDI portal
Publication:4559697

DOI10.1080/01621459.2017.1319838zbMATH Open1402.62011arXiv1411.6144OpenAlexW1844989601MaRDI QIDQ4559697FDOQ4559697

Russell A. Poldrack, James G. Scott, Oluwasanmi Koyejo, Wesley Tansey

Publication date: 4 December 2018

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1411.6144




Recommendations




Cites Work


Cited In (18)

Uses Software





This page was built for publication: False Discovery Rate Smoothing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559697)