Communication-Efficient Distributed Multiple Testing for Large-Scale Inference

01/31/2022
by   Mehrdad Pournaderi, et al.
0

The Benjamini-Hochberg (BH) procedure is a celebrated method for multiple testing with false discovery rate (FDR) control. In this paper, we consider large-scale distributed networks where each node possesses a large number of p-values and the goal is to achieve the global BH performance in a communication-efficient manner. We propose that every node performs a local test with an adjusted test size according to the (estimated) global proportion of true null hypotheses. With suitable assumptions, our method is asymptotically equivalent to the global BH procedure. Motivated by this, we develop an algorithm for star networks where each node only needs to transmit an estimate of the (local) proportion of nulls and the (local) number of p-values to the center node; the center node then broadcasts a parameter (computed based on the global estimate and test size) to the local nodes. In the experiment section, we utilize existing estimators of the proportion of true nulls and consider various settings to evaluate the performance and robustness of our method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2022

On Large-Scale Multiple Testing Over Networks: An Asymptotic Approach

This work concerns developing communication- and computation-efficient m...
research
02/28/2020

A New Procedure for Controlling False Discovery Rate in Large-Scale t-tests

This paper is concerned with false discovery rate (FDR) control in large...
research
03/20/2021

Distance Assisted Recursive Testing

In many applications, a large number of features are collected with the ...
research
08/24/2022

Flexible control of the median of the false discovery proportion

We introduce a multiple testing method that controls the median of the p...
research
07/19/2023

Communication-Efficient Distribution-Free Inference Over Networks

Consider a star network where each local node possesses a set of distrib...
research
03/24/2021

Structure-Aware Face Clustering on a Large-Scale Graph with 10^7 Nodes

Face clustering is a promising method for annotating unlabeled face imag...
research
10/09/2022

QuTE: decentralized multiple testing on sensor networks with false discovery rate control

This paper designs methods for decentralized multiple hypothesis testing...

Please sign up or login with your details

Forgot password? Click here to reset