Penalized Estimation of Directed Acyclic Graphs From Discrete Data

Abstract

Bayesian networks, with structure given by a directed acyclic graph (DAG), are a popular class of graphical models. However, learning Bayesian networks from discrete or categorical data is particularly challenging, due to the large parameter space and the difficulty in searching for a sparse structure. In this article, we develop a maximum penalized likelihood method to tackle this problem. Instead of the commonly used multinomial distribution, we model the conditional distribution of a node given its parents by multi-logit regression, in which an edge is parameterized by a set of coefficient vectors with dummy variables encoding the levels of a node. To obtain a sparse DAG, a group norm penalty is employed, and a blockwise coordinate descent algorithm is developed to maximize the penalized likelihood subject to the acyclicity constraint of a DAG. When interventional data are available, our method constructs a causal network, in which a directed edge represents a causal relation. We apply our method to various simulated and real data sets. The results show that our method is very competitive, compared to many existing methods, in DAG estimation from both interventional and high-dimensional observational data.

To appear in Statistics and Computing

References in corpus (6)

• Pathwise coordinate optimization
• Coordinate descent algorithms for lasso penalized regression
• ${\ell }_0$-penalized maximum likelihood for sparse directed acyclic graphs
• Jointly interventional and observational data: estimation of interventional Markov equivalence classes of directed acyclic graphs
• Inferring Regulatory Networks by Combining Perturbation Screens and Steady State Gene Expression Profiles
• Inferring large graphs using l1-penalized likelihood

Cited by in corpus (5)

• Optimizing regularized Cholesky score for order-based learning of Bayesian networks
• Distributed Learning of Generalized Linear Causal Networks
• Nonlinear Causal Discovery with Confounders
• Model selection and local geometry
• Discovery and inference of a causal network with hidden confounding