Integer programming for learning directed acyclic graphs from nonidentifiable Gaussian models
非可识别高斯模型中有向无环图学习的整数规划
Summary We study the problem of learning directed acyclic graphs from continuous observational data, generated according to a linear Gaussian structural equation model. State-of-the-art structure learning methods for this setting have at least one of the following shortcomings: (i) they cannot provide optimality guarantees and can suffer from learning suboptimal models; (ii) they rely on the stringent assumption that the noise is homoscedastic, and hence the underlying model…