Learning Sparse Nonparametric DAGs

AISTATS, pp. 3414-3425, 2019.

Cited by: 19|Views34
EI

Abstract:

We develop a framework for learning sparse nonparametric directed acyclic graphs (DAGs) from data. Our approach is based on a recent algebraic characterization of DAGs that led to the first fully continuous optimization for score-based learning of DAG models parametrized by a linear structural equation model (SEM). We extend this algebr...More

Code:

Data:

Your rating :
0

 

Tags
Comments