DeepAI AI Chat
Log In Sign Up

Tree-based Node Aggregation in Sparse Graphical Models

by   Ines Wilms, et al.

High-dimensional graphical models are often estimated using regularization that is aimed at reducing the number of edges in a network. In this work, we show how even simpler networks can be produced by aggregating the nodes of the graphical model. We develop a new convex regularized method, called the tree-aggregated graphical lasso or tag-lasso, that estimates graphical models that are both edge-sparse and node-aggregated. The aggregation is performed in a data-driven fashion by leveraging side information in the form of a tree that encodes node similarity and facilitates the interpretation of the resulting aggregated nodes. We provide an efficient implementation of the tag-lasso by using the locally adaptive alternating direction method of multipliers and illustrate our proposal's practical advantages in simulation and in applications in finance and biology.


page 3

page 22

page 25


Learning Gaussian Graphical Models Using Discriminated Hub Graphical Lasso

We develop a new method called Discriminated Hub Graphical Lasso (DHGL) ...

Learning Graphical Models With Hubs

We consider the problem of learning a high-dimensional graphical model i...

Inference in high-dimensional graphical models

We provide a selected overview of methodology and theory for estimation ...

Learning high-dimensional graphical models with regularized quadratic scoring

Pairwise Markov Random Fields (MRFs) or undirected graphical models are ...

Structure learning for extremal tree models

Extremal graphical models are sparse statistical models for multivariate...

Graphical model inference with external network data

A frequent challenge when using graphical models in applications is that...

Node-Based Learning of Multiple Gaussian Graphical Models

We consider the problem of estimating high-dimensional Gaussian graphica...