Learning Graphical Models With Hubs

Abstract

We consider the problem of learning a high-dimensional graphical model in which certain hub nodes are highly-connected to many other nodes. Many authors have studied the use of an l1 penalty in order to learn a sparse graph in high-dimensional setting. However, the l1 penalty implicitly assumes that each edge is equally likely and independent of all other edges. We propose a general framework to accommodate more realistic networks with hub nodes, using a convex formulation that involves a row-column overlap norm penalty. We apply this general framework to three widely-used probabilistic graphical models: the Gaussian graphical model, the covariance graph model, and the binary Ising model. An alternating direction method of multipliers algorithm is used to solve the corresponding convex optimization problems. On synthetic data, we demonstrate that our proposed framework outperforms competitors that do not explicitly model hub nodes. We illustrate our proposal on a webpage data set and a gene expression data set.

Cited by in corpus (17)

• Low Rank and Structured Modeling of High-dimensional Vector Autoregressions
• Network assisted analysis to reveal the genetic basis of autism
• On Semiparametric Exponential Family Graphical Models
• Learning Scale-Free Networks by Dynamic Node-Specific Degree Prior
• Learning complex dependency structure of gene regulatory networks from high dimensional micro-array data with Gaussian Bayesian networks
• Sparse principal component regression via singular value decomposition approach
• Regularization for supervised learning via the "hubNet" procedure
• Learning the effect of latent variables in Gaussian Graphical models with unobserved variables
• On the Sample Complexity of Graphical Model Selection for Non-Stationary Processes
• Learning from Pairwise Marginal Independencies
• The folded concave Laplacian spectral penalty learns block diagonal sparsity patterns with the strong oracle property
• Group Invariance and Computational Sufficiency
• Robust sparse Gaussian graphical modeling
• Learning Gaussian Graphical Models Using Discriminated Hub Graphical Lasso
• Exponential Family Graphical Models: Correlated Replicates and Unmeasured Confounders, with Applications to fMRI Data
• Estimation of Graphical Models through Structured Norm Minimization
• Network Inference by Learned Node-Specific Degree Prior