On Convergence of Kronecker Graphical Lasso Algorithms
From MaRDI portal
Abstract: This paper studies iteration convergence of Kronecker graphical lasso (KGLasso) algorithms for estimating the covariance of an i.i.d. Gaussian random sample under a sparse Kronecker-product covariance model and MSE convergence rates. The KGlasso model, originally called the transposable regularized covariance model by Allen ["Transposable regularized covariance models with an application to missing data imputation," Ann. Appl. Statist., vol. 4, no. 2, pp. 764-790, 2010], implements a pair of penalties on each Kronecker factor to enforce sparsity in the covariance estimator. The KGlasso algorithm generalizes Glasso, introduced by Yuan and Lin ["Model selection and estimation in the Gaussian graphical model," Biometrika, vol. 94, pp. 19-35, 2007] and Banerjee ["Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data," J. Mach. Learn. Res., vol. 9, pp. 485-516, Mar. 2008], to estimate covariances having Kronecker product form. It also generalizes the unpenalized ML flip-flop (FF) algorithm of Dutilleul ["The MLE algorithm for the matrix normal distribution," J. Statist. Comput. Simul., vol. 64, pp. 105-123, 1999] and Werner ["On estimation of covariance matrices with Kronecker product structure," IEEE Trans. Signal Process., vol. 56, no. 2, pp. 478-491, Feb. 2008] to estimation of sparse Kronecker factors. We establish that the KGlasso iterates converge pointwise to a local maximum of the penalized likelihood function. We derive high dimensional rates of convergence to the true covariance as both the number of samples and the number of variables go to infinity. Our results establish that KGlasso has significantly faster asymptotic convergence than Glasso and FF. Simulations are presented that validate the results of our analysis.
Cited in
(21)- Hypothesis Testing of Matrix Graph Model with Application to Brain Connectivity Analysis
- Kronecker delta method for testing independence between two vectors in high-dimension
- Multilinear compressive sensing and an application to convolutional linear networks
- Gaussian and robust Kronecker product covariance estimation: existence and uniqueness
- Gemini: graph estimation with matrix variate normal instances
- Near optimal sample complexity for matrix and tensor normal models via geodesic convexity
- Kronecker-structured covariance models for multiway data
- Concentration of measure bounds for matrix-variate data with missing values
- Robust ground moving target detection for airborne radar using a novel feature-based machine learning approach
- scientific article; zbMATH DE number 7626713 (Why is no real title available?)
- Tucker tensor factor models: matricization and mode-wise PCA estimation
- Toward fast transform learning
- Structured regularization covariance estimation in tensor-valued data analysis
- Information geometry and asymptotics for Kronecker covariances
- Fast and Separable Estimation in High-Dimensional Tensor Gaussian Graphical Models
- Mode-wise principal subspace pursuit and matrix spiked covariance model
- Alteration detection of tensor dependence structure via sparsity-exploited reranking algorithm
- Graphical model selection and estimation for high dimensional tensor data
- Autoregressive identification of Kronecker graphical models
- Nonparametric identification of Kronecker networks
- Support Recovery and Parameter Identification of Multivariate ARMA Systems with Exogenous Inputs
This page was built for publication: On Convergence of Kronecker Graphical Lasso Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4578498)
