Logo image
DNNLasso: Scalable Graph Learning for Matrix-Variate Data
Conference proceeding

DNNLasso: Scalable Graph Learning for Matrix-Variate Data

Meixia Lin and Yangjing Zhang
INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 238, Vol.238, pp.316-324
Proceedings of Machine Learning Research
01/01/2024

Abstract

Computer Science Computer Science, Artificial Intelligence Computer Science, Theory & Methods Mathematics Mathematics, Applied Physical Sciences Science & Technology Statistics & Probability Technology
We consider the problem of jointly learning row-wise and column-wise dependencies of matrix-variate observations, which are modelled separately by two precision matrices. Due to the complicated structure of Kronecker-product precision matrices in the commonly used matrix-variate Gaussian graphical models, a sparser Kronecker-sum structure was proposed recently based on the Cartesian product of graphs. However, existing methods for estimating Kronecker-sum structured precision matrices do not scale well to large scale datasets. In this paper, we introduce DNNLasso, a diagonally non-negative graphical lasso model for estimating the Kronecker-sum structured precision matrix, which outperforms the state-of-the-art methods by a large margin in both accuracy and computational time. Our code is available at https://github.com/ YangjingZhang/DNNLasso.

Metrics

1 Record Views

Details

Logo image