StarTrek: Combinatorial Variable Selection with False Discovery Rate Control

Abstract

Variable selection on the large-scale networks has been extensively studied in the literature. While most of the existing methods are limited to the local functionals especially the graph edges, this paper focuses on selecting the discrete hub structures of the networks. Specifically, we propose an inferential method, called StarTrek filter, to select the hub nodes with degrees larger than a certain thresholding level in the high dimensional graphical models and control the false discovery rate (FDR). Discovering hub nodes in the networks is challenging: there is no straightforward statistic for testing the degree of a node due to the combinatorial structures; complicated dependence in the multiple testing problem is hard to characterize and control. In methodology, the StarTrek filter overcomes this by constructing p-values based on the maximum test statistics via the Gaussian multiplier bootstrap. In theory, we show that the StarTrek filter can control the FDR by providing accurate bounds on the approximation errors of the quantile estimation and addressing the dependence structures among the maximal statistics. To this end, we establish novel Cramér-type comparison bounds for the high dimensional Gaussian random vectors. Comparing to the Gaussian comparison bound via the Kolmogorov distance established by \citet{chernozhukov2014anti}, our Cramér-type comparison bounds establish the relative difference between the distribution functions of two high dimensional Gaussian random vectors. We illustrate the validity of the StarTrek filter in a series of numerical experiments and apply it to the genotype-tissue expression dataset to discover central regulator genes.

References in corpus (19)

• Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
• The huge Package for High-dimensional Undirected Graph Estimation in R
• A modern maximum-likelihood theory for high-dimensional logistic regression
• Asymptotic normality and optimalities in estimation of large Gaussian graphical models
• Optimal hypothesis testing for high dimensional covariance matrices
• Inference for High-dimensional Differential Correlation Matrices
• The Asymptotic Distribution of the MLE in High-dimensional Logistic Models: Arbitrary Covariance
• Cramér-type moderate deviations for Studentized two-sample $U$-statistics with applications
• The knockoff filter for FDR control in group-sparse and multitask regression
• Local and Global Inference for High Dimensional Nonparanormal Graphical Models
• Integrative High Dimensional Multiple Testing with Heterogeneity under Data Sharing Constraints
• Controlling False Discovery Rate Using Gaussian Mirrors
• False Discovery Rate Control via Data Splitting
• Estimation of the number of spiked eigenvalues in a covariance matrix by bulk eigenvalue matching analysis
• High-Dimensional Inference for Cluster-Based Graphical Models
• GGM knockoff filter: False Discovery Rate Control for Gaussian Graphical Models
• Adaptive Inferential Method for Monotone Graph Invariants
• A Scale-free Approach for False Discovery Rate Control in Generalized Linear Models
• Combinatorial-Probabilistic Trade-Off: Community Properties Test in the Stochastic Block Models