Online Program Home
  My Program

Abstract Details

Activity Number: 81 - Graphical Models
Type: Contributed
Date/Time: Sunday, July 30, 2017 : 4:00 PM to 5:50 PM
Sponsor: Section on Statistical Learning and Data Science
Abstract #324430
Title: Neighborhood Selection for Gaussian Graphical Model with Vecotr-Valued Nodes
Author(s): Yanzhen Deng*
Companies:
Keywords: convex regularization ; block norm regularizer ; sparsity recovery ; nodewise regression ; graphical model
Abstract:

Gaussian graphical model (GGM) is widely used to reflect the relationship between a large number of random variables. In this work, we generalize the classical GGM, so that each node in the graph represents a random vector instead of random variable. We propose to estimate the high-level conditional independence graph using nodewise regression. The response is one node and covariates are all other nodes, so in our setting, this regression has multivariate response and grouped covariates. The edges are decided by the block-wise sparsity of the coefficients, so we use a block-norm regularization to induce the sparsity we want. The success of graph estimation relies on the sparsity recovery of each regression, and our theory reveals under what conditions do we have exact and partial sparsity recovery for this type of regression.


Authors who are presenting talks have a * after their name.

Back to the full JSM 2017 program

 
 
Copyright © American Statistical Association