BriefGPT.xyz
Jun, 2020
不强制无环的情况下学习有向无环图(DAGs)
Learning DAGs without imposing acyclicity
HTML
PDF
Gherardo Varando
TL;DR
本文章通过L1正则化优化的稀疏矩阵分解方法，得到逼近DAG的图结构，避免了传统结构学习算法在组合复杂度方面的缺陷。
Abstract
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
→