Learning directed acyclic graphs based on sparsest permutations

Garvesh Raskutti, Caroline Uhler

We consider the problem of learning a Bayesian network or directed acyclic graph (DAG) model from observational data. A number of constraint-based, score-based and hybrid algorithm…