Corpus ID: 53217974

DAGs with NO TEARS: Continuous Optimization for Structure Learning

@inproceedings{Zheng2018DAGsWN,
  title={DAGs with NO TEARS: Continuous Optimization for Structure Learning},
  author={Xun Zheng and Bryon Aragam and Pradeep Ravikumar and E. Xing},
  booktitle={NeurIPS},
  year={2018}
}
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. [...] Key Method This is achieved by a novel characterization of acyclicity that is not only smooth but also exact. The resulting problem can be efficiently solved by standard numerical algorithms, which also makes implementation effortless. The proposed method outperforms existing ones…Expand
Learning DAGs with Continuous Optimization
DAGs with No Curl: An Efficient DAG Structure Learning Approach
Learning DAGs without imposing acyclicity
On the Convergence of Continuous Constrained Optimization for Structure Learning
Learning Large DAGs by Combining Continuous Optimization and Feedback Arc Set Heuristics
Low Rank Directed Acyclic Graphs and Causal Structure Learning
Consistent Second-Order Conic Integer Programming for Learning Bayesian Networks
Learning Sparse Nonparametric DAGs
DAG-GNN: DAG Structure Learning with Graph Neural Networks
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 62 REFERENCES
Penalized estimation of directed acyclic graphs from discrete data
A Simple Approach for Finding the Globally Optimal Bayesian Network Structure
Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks
A* Lasso for Learning a Sparse Bayesian Network Structure for Continuous Variables
Learning Directed Acyclic Graphs with Penalized Neighbourhood Regression
Optimal Structure Identification With Greedy Search
Bayesian network learning with cutting planes
Finding optimal Bayesian networks by dynamic programming
Learning Graphical Model Structure Using L1-Regularization Paths
...
1
2
3
4
5
...