Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
Authors:
- 1 March 2013
- journal article
- research article
- Published by Taylor & Francis in Journal of the American Statistical Association
- Vol. 108 (501) , 288-300
Abstract
Causal networks are graphically represented by directed acyclic graphs (DAGs). Learning causal networks from data is a challenging problem due to the size of the space of DAGs, the acyclicity constraint placed on the graphical structures, and the presence of equivalence classes. In this article, we develop an L 1-penalized likelihood approach to estimate the structure of causal Gaussian networks. A blockwise coordinate descent algorithm, which takes advantage of the acyclicity constraint, is proposed for seeking a local maximizer of the penalized likelihood. We establish that model selection consistency for causal Gaussian networks can be achieved with the adaptive lasso penalty and sufficient experimental interventions. Simulation and real data examples are used to demonstrate the effectiveness of our method. In particular, our method shows satisfactory performance for DAGs with 200 nodes, which have about 20,000 free parameters. Supplementary materials for this article are available online.Keywords
This publication has 26 references indexed in Scilit:
- Sparsistency and rates of convergence in large covariance matrix estimationThe Annals of Statistics, 2009
- Network exploration via the adaptive LASSO and SCAD penaltiesThe Annals of Applied Statistics, 2009
- Learning Causal Bayesian Network Structures From Experimental DataJournal of the American Statistical Association, 2008
- Sparse inverse covariance estimation with the graphical lassoBiostatistics, 2007
- Pathwise coordinate optimizationThe Annals of Applied Statistics, 2007
- Least angle regressionThe Annals of Statistics, 2004
- Being Bayesian About Network Structure. A Bayesian Approach to Structure Discovery in Bayesian NetworksMachine Learning, 2003
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle PropertiesJournal of the American Statistical Association, 2001
- Penalized Regressions: The Bridge versus the LassoJournal of Computational and Graphical Statistics, 1998
- Adapting to Unknown Smoothness via Wavelet ShrinkageJournal of the American Statistical Association, 1995