A constrained L1 minimization approach for estimating multiple Sparse Gaussian or Nonparanormal Graphical Models

05/11/2016
by   Beilun Wang, et al.
0

Identifying context-specific entity networks from aggregated data is an important task, arising often in bioinformatics and neuroimaging. Computationally, this task can be formulated as jointly estimating multiple different, but related, sparse Undirected Graphical Models (UGM) from aggregated samples across several contexts. Previous joint-UGM studies have mostly focused on sparse Gaussian Graphical Models (sGGMs) and can't identify context-specific edge patterns directly. We, therefore, propose a novel approach, SIMULE (detecting Shared and Individual parts of MULtiple graphs Explicitly) to learn multi-UGM via a constrained L1 minimization. SIMULE automatically infers both specific edge patterns that are unique to each context and shared interactions preserved among all the contexts. Through the L1 constrained formulation, this problem is cast as multiple independent subtasks of linear programming that can be solved efficiently in parallel. In addition to Gaussian data, SIMULE can also handle multivariate Nonparanormal data that greatly relaxes the normality assumption that many real-world applications do not follow. We provide a novel theoretical proof showing that SIMULE achieves a consistent result at the rate O(log(Kp)/n_tot). On multiple synthetic datasets and two biomedical datasets, SIMULE shows significant improvement over state-of-the-art multi-sGGM and single-UGM baselines.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 29

06/01/2018

A Fast and Scalable Joint Estimator for Integrating Additional Knowledge in Learning Multiple Related Sparse Gaussian Graphical Models

We consider the problem of including additional knowledge in estimating ...
02/09/2017

A Fast and Scalable Joint Estimator for Learning Multiple Related Sparse Gaussian Graphical Models

Estimating multiple sparse Gaussian Graphical Models (sGGMs) jointly for...
01/10/2013

Network-based clustering with mixtures of L1-penalized Gaussian graphical models: an empirical investigation

In many applications, multivariate samples may harbor previously unrecog...
10/30/2017

Fast and Scalable Learning of Sparse Changes in High-Dimensional Gaussian Graphical Model Structure

We focus on the problem of estimating the change in the dependency struc...
02/28/2014

Learning Graphical Models With Hubs

We consider the problem of learning a high-dimensional graphical model i...
05/09/2012

Group Sparse Priors for Covariance Estimation

Recently it has become popular to learn sparse Gaussian graphical models...
03/09/2019

Learning Quantum Graphical Models using Constrained Gradient Descent on the Stiefel Manifold

Quantum graphical models (QGMs) extend the classical framework for reaso...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.