Penalized Maximum Likelihood Estimation of Multi-layered Gaussian Graphical Models

Abstract

Analyzing multi-layered graphical models provides insight into understanding the conditional relationships among nodes within layers after adjusting for and quantifying the effects of nodes from other layers. We obtain the penalized maximum likelihood estimator for Gaussian multi-layered graphical models, based on a computational approach involving screening of variables, iterative estimation of the directed edges between layers and undirected edges within layers and a final refitting and stability selection step that provides improved performance in finite sample settings. We establish the consistency of the estimator in a high-dimensional setting. To obtain this result, we develop a strategy that leverages the biconvexity of the likelihood function to ensure convergence of the developed iterative algorithm to a stationary point, as well as careful uniform error control of the estimates over iterations. The performance of the maximum likelihood estimator is illustrated on synthetic data.

References in corpus (4)

• The huge Package for High-dimensional Undirected Graph Estimation in R
• Parallel Coordinate Descent for L1-Regularized Loss Minimization
• A sparse conditional Gaussian graphical model for analysis of genetical genomics data
• Scaling Up Coordinate Descent Algorithms for Large ${\ell }_1$ Regularization Problems

Cited by in corpus (4)

• Bayesian Inference of Networks Across Multiple Sample Groups and Data Types
• Joint Estimation and Inference for Data Integration Problems based on Multiple Multi-layered Gaussian Graphical Models
• High-dimensional Gaussian graphical model for network-linked data
• Group induced graphical lasso allows for discovery of molecular pathways-pathways interactions