Skip to yearly menu bar Skip to main content


Semiparametric Differential Graph Models

Pan Xu · Quanquan Gu

Area 5+6+7+8 #120

Keywords: [ Graphical Models ] [ Sparsity and Feature Selection ]


In many cases of network analysis, it is more attractive to study how a network varies under different conditions than an individual static network. We propose a novel graphical model, namely Latent Differential Graph Model, where the networks under two different conditions are represented by two semiparametric elliptical distributions respectively, and the variation of these two networks (i.e., differential graph) is characterized by the difference between their latent precision matrices. We propose an estimator for the differential graph based on quasi likelihood maximization with nonconvex regularization. We show that our estimator attains a faster statistical rate in parameter estimation than the state-of-the-art methods, and enjoys oracle property under mild conditions. Thorough experiments on both synthetic and real world data support our theory.

Live content is unavailable. Log in and register to view live content