DAGs with NO TEARS - Continuous Optimization for Structure Learning

ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), pp. 9492-9503, 2018.

Cited by: 100|Views67
EI

Abstract:

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. In this paper, we introdu...More

Code:

Data:

Your rating :
0

 

Tags
Comments