Causal Network Inference Via Group Sparse Regularization


This paper addresses the problem of inferring sparse causal networks modeled by multivariate autoregressive (MAR) processes. Conditions are derived under which the Group Lasso (gLasso) procedure consistently estimates sparse network structure. The key condition involves a “false connection score” ψ. In particular, we show that consistent recovery is possible even when the number of observations of the network is far less than the number of parameters describing the network, provided that ψ <; 1. The false connection score is also demonstrated to be a useful metric of recovery in nonasymptotic regimes. The conditions suggest a modified gLasso procedure which tends to improve the false connection score and reduce the chances of reversing the direction of causal influence. Computational experiments and a real network based electrocorticogram (ECoG) simulation study demonstrate the effectiveness of the approach.

DOI: 10.1109/TSP.2011.2129515

Extracted Key Phrases

9 Figures and Tables

Citations per Year

68 Citations

Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Bolstad2011CausalNI, title={Causal Network Inference Via Group Sparse Regularization}, author={Andrew K. Bolstad and Barry D. Van Veen and Robert D. Nowak}, journal={IEEE Transactions on Signal Processing}, year={2011}, volume={59}, pages={2628-2641} }