Simultaneous Inference in Multiple Matrix-Variate Graphs for High-Dimensional Neural Recordings
Zongge Liu, Heejong Bong, Zhao Ren, Matthew A. Smith, Robert E. Kass
TL;DR
This work addresses high-dimensional simultaneous inference for multiple matrix-variate Gaussian graphical models, motivated by spatiotemporal neural data collected across heterogeneous groups. It introduces a joint estimation approach using group Lasso to share sparsity patterns across groups, coupled with a Gaussian-approximation bootstrap to perform edge-set testing with validity under temporal dependence. Theoretical results establish non-asymptotic estimation guarantees and near-optimal detection boundaries for simultaneous testing, while simulations and neural-data analysis demonstrate improved power and meaningful brain connectivity insights across task stages. The method is computationally tractable, relying on convex optimization and parametric bootstrap, and is demonstrated on V4–PFC recordings to reveal stage-specific cross-area dynamics with potential cognitive relevance.
Abstract
We study simultaneous inference for multiple matrix-variate Gaussian graphical models in high-dimensional settings. Such models arise when spatiotemporal data are collected across multiple sample groups or experimental sessions, where each group is characterized by its own graphical structure but shares common sparsity patterns. A central challenge is to conduct valid inference on collections of graph edges while efficiently borrowing strength across groups under both high-dimensionality and temporal dependence. We propose a unified framework that combines joint estimation via group penalized regression with a high-dimensional Gaussian approximation bootstrap to enable global testing of edge subsets of arbitrary size. The proposed procedure accommodates temporally dependent observations and avoids naive pooling across heterogeneous groups. We establish theoretical guarantees for the validity of the simultaneous tests under mild conditions on sample size, dimensionality, and non-stationary autoregressive temporal dependence, and show that the resulting tests are nearly optimal in terms of the testable region boundary. The method relies only on convex optimization and parametric bootstrap, making it computationally tractable. Simulation studies and a neural recording example illustrate the efficacy of the proposed approach.
