Skip to yearly menu bar Skip to main content


Learning Additive Exponential Family Graphical Models via $\ell_{2,1}$-norm Regularized M-Estimation

Xiaotong Yuan · Ping Li · Tong Zhang · Qingshan Liu · Guangcan Liu

Area 5+6+7+8 #133

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

Abstract: We investigate a subclass of exponential family graphical models of which the sufficient statistics are defined by arbitrary additive forms. We propose two $\ell_{2,1}$-norm regularized maximum likelihood estimators to learn the model parameters from i.i.d. samples. The first one is a joint MLE estimator which estimates all the parameters simultaneously. The second one is a node-wise conditional MLE estimator which estimates the parameters for each node individually. For both estimators, statistical analysis shows that under mild conditions the extra flexibility gained by the additive exponential family models comes at almost no cost of statistical efficiency. A Monte-Carlo approximation method is developed to efficiently optimize the proposed estimators. The advantages of our estimators over Gaussian graphical models and Nonparanormal estimators are demonstrated on synthetic and real data sets.

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