Graph estimation for matrix-variate Gaussian data
From MaRDI portal
Abstract: Matrix-variate Gaussian graphical models (GGM) have been widely used for modeling matrix-variate data. Since the support of sparse precision matrix represents the conditional independence graph among matrix entries, conducting support recovery yields valuable information. A commonly used approach is the penalized log-likelihood method. However, due to the complicated structure of precision matrices in the form of Kronecker product, the log-likelihood is non-convex, which presents challenges for both computation and theoretical analysis. In this paper, we propose an alternative approach by formulating the support recovery problem into a multiple testing problem. A new test statistic is developed and based on that, we use the popular Benjamini and Hochberg's procedure to control false discovery rate (FDR) asymptotically. Our method involves only convex optimization, making it computationally attractive. Theoretically, our method allows very weak conditions, i.e., even when the sample size is finite and the dimensions go to infinity, the asymptotic normality of the test statistics and FDR control can still be guaranteed. We further provide the power analysis result. The finite sample performance of the proposed method is illustrated by both simulated and real data analysis.
Recommendations
Cited in
(15)- On the total variation regularized estimator over a class of tree graphs
- Adaptive estimation of nonparametric geometric graphs
- Existence and uniqueness of the Kronecker covariance MLE
- Gemini: graph estimation with matrix variate normal instances
- Testing and support recovery of correlation structures for matrix-valued observations with an application to stock market data
- Correlation-driven framework based on graph convolutional network for clinical disease classification
- Estimation of means in graphical Gaussian models with symmetries
- Multiple Matrix Gaussian Graphs Estimation
- Moment-Based Estimation of Stochastic Kronecker Graph Parameters
- Structure learning of exponential family graphical model with false discovery rate control
- Testing the differential network between two gaussian graphical models with false discovery rate control
- Support recovery of Gaussian graphical model with false discovery rate control
- Alteration detection of tensor dependence structure via sparsity-exploited reranking algorithm
- Sparse Model-Based Clustering of Three-Way Data via Lasso-Type Penalties
- Mode-wise principal subspace pursuit and matrix spiked covariance model
This page was built for publication: Graph estimation for matrix-variate Gaussian data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626701)
