2019 (modified: 11 Nov 2022)ICML 2019Readers: Everyone
Abstract:Learning a faithful directed acyclic graph (DAG) from samples of a joint distribution is a challenging combinatorial problem, owing to the intractable search space superexponential in the number of...