DAGs with NO TEARS: Continuous Optimization for Structure Learning

NeurIPS 2018 Xun ZhengBryon AragamPradeep RavikumarEric P. Xing

Estimating the structure of directed acyclic graphs (DAGs, also known as Bayesian networks) is a challenging problem since the search space of DAGs is combinatorial and scales superexponentially with the number of nodes. Existing approaches rely on various local heuristics for enforcing the acyclicity constraint... (read more)

PDF Abstract NeurIPS 2018 PDF NeurIPS 2018 Abstract

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet