Learning Large DAGs by Combining Continuous Optimization and Feedback Arc Set Heuristics

Bayesian networks represent relations between variables using a directed acyclic graph (DAG). Learning the DAG is an NPhard problem and exact learning algorithms are feasible only for small sets of variables. We propose two scalable heuristics for learning DAGs in the linear structural equation case. Our methods learn the DAG by alternating between unconstrained gradient descent-based step to optimize an objective function and solving a maximum acyclic subgraph problem to enforce acyclicity. Thanks to this decoupling, our methods scale up beyond thousands of variables.

Authors

• Pierre Gillot
• Pekka Parviainen

Keywords

No keywords are indexed for this paper.