Reviews: Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexity

In particular, it establishes that as long as noises are homoscedastic, then under a milder minimality/faithfulness assumptions it is possible to efficiently recover the GBN. Clarity The paper is heavy on notation, but everything is explained and organized clearly.