Learning Graphical Model Structure Using L1-Regularization Paths

Sparsity-promoting L1-regularization has recently been succesfully used to learn the structure of undirected graphical models. In this paper, we apply this technique to learn the structure of directed graphical models. Specifically, we make three contributions. First, we show how the decomposability of the MDL score, plus the ability to quickly compute entire regularization paths, allows us to efficiently pick the optimal regularization parameter on a per-node basis. Second, we show how to use L1 variable selection to select the Markov blanket, before a DAG search stage. Finally, we show how L1 variable selection can be used inside of an order search algorithm. The effectiveness of these L1-based approaches are compared to current state of the art methods on 10 datasets.

• Type: Conference
• Year: 2007
• Where: AAAI
• Authors: Mark W. Schmidt, Alexandru Niculescu-Mizil, Kevin P. Murphy
• Keywords: AAAI 2007, Graphical Models, Intelligent Agents, Undirected Graphical Models, Variable Selection