Multi-Task Learning for Gaussian Graphical Regressions with High Dimensional Covariates

• Published in: Journal of computational and graphical statistics Vol. 34; no. 3; pp. 961 - 970
• Main Authors: Zhang, Jingfei, Li, Yi
• Format: Journal Article
• Language: English
• Published: United States Taylor & Francis 03.07.2025
• Subjects: Co-expression quantitative trait loci; Concentration inequality for dependent variables; Graphical model with covariates; Multi-task learning; Subject-specific Gaussian graphical model; graphical model with covariates; multi-task learning; subject-specific Gaussian graphical model; coexpression quantitative trait loci; concentration inequality for dependent variables
• ISSN: 1061-8600; 1537-2715
• DOI: 10.1080/10618600.2024.2421246

Gaussian graphical regression is a powerful approach for regressing the precision matrix of a Gaussian graphical model on covariates, which permits the response variables and covariates to outnumber the sample size. However, traditional approaches of fitting the model via separate node-wise lasso regressions overlook the network-induced structure among these regressions, leading to high error rates, particularly when the number of nodes is large. To address this issue, we propose a multi-task learning estimator for fitting Gaussian graphical regression models, which incorporates a cross-task group sparsity penalty and a within-task element-wise sparsity penalty to govern the sparsity of active covariates and their effects on the graph, respectively. We also develop an efficient augmented Lagrangian algorithm for computation, which solves subproblems with a semi-smooth Newton method. We further prove that our multi-task learning estimator has considerably lower error rates than the separate node-wise regression estimates, as the cross-task penalty enables borrowing information across tasks. We examine the utility of our method through simulations and an application to a gene co-expression network study with brain cancer patients. Supplementary materials for this article are available online.