DeepAI AI Chat
Log In Sign Up

Learning DAGs without imposing acyclicity

06/04/2020
by   Gherardo Varando, et al.
Københavns Uni
0

We explore if it is possible to learn a directed acyclic graph (DAG) from data without imposing explicitly the acyclicity constraint. In particular, for Gaussian distributions, we frame structural learning as a sparse matrix factorization problem and we empirically show that solving an ℓ_1-penalized optimization yields to good recovery of the true graph and, in general, to almost-DAG graphs. Moreover, this approach is computationally efficient and is not affected by the explosion of combinatorial complexity as in classical structural learning algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/22/2019

A Unified Framework for Structured Graph Learning via Spectral Constraints

Graph learning from data represents a canonical problem that has receive...
07/01/2021

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

Bayesian networks represent relations between variables using a directed...
07/15/2017

Learning linear structural equation models in polynomial time and sample complexity

The problem of learning structural equation models (SEMs) from data is a...
06/28/2019

Cross-product Penalized Component Analysis (XCAN)

Matrix factorization methods are extensively employed to understand comp...
11/29/2015

Learning Directed Acyclic Graphs with Penalized Neighbourhood Regression

We study a family of regularized score-based estimators for learning the...
02/09/2021

On structural and practical identifiability

We discuss issues of structural and practical identifiability of partial...
02/29/2012

Uniform random generation of large acyclic digraphs

Directed acyclic graphs are the basic representation of the structure un...

Code Repositories

nodag

structure recovery without imposing acyclicity


view repo