无所畏惧的DAG:学习贝叶斯网络的连续优化
DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networks
摘要:
本文重新审视了一个连续的优化框架,称为NOTEARS学习贝叶斯网络。首先,我们推广现有的代数特征的无环性的一类矩阵多项式。接下来,专注于一个参数,每边设置,它表明,Karush-Kuhn-Tucker(KKT)的最优性条件的NOTEARS制定不能满足,除非在一个平凡的情况下,这解释了相关的算法的行为。然后,我们推导出KKT条件的等价的重新制定,表明它们确实是必要的,并将它们与明确的限制,某些边缘缺席的图形。如果得分函数是凸的,这些KKT条件也足以满足局部极小,尽管约束是非凸的。通知的KKT条件,提出了一个本地搜索后处理算法,并示出了大幅度和普遍改善的结构汉明距离的所有测试算法,通常由2个或更多的因素。一些与局部搜索的组合比原始NOTEARS更准确,更有效。
英文摘要:
This paper re-examines a continuous optimization framework dubbed NOTEARS for learning Bayesian networks. We first generalize existing algebraic characterizations of acyclicity to a class of matrix polynomials. Next, focusing on a one-parameter-per-edge setting, it is shown that the Karush-Kuhn-Tucker (KKT) optimality conditions for the NOTEARS formulation cannot be satisfied except in a trivial case, which explains a behavior of the associated algorithm. We then derive the KKT conditions for an equivalent reformulation, show that they are indeed necessary, and relate them to explicit constraints that certain edges be absent from the graph. If the score function is convex, these KKT conditions are also sufficient for local minimality despite the non-convexity of the constraint. Informed by the KKT conditions, a local search post-processing algorithm is proposed and shown to substantially and universally improve the structural Hamming distance of all tested algorithms, typically by a factor of 2 or more. Some combinations with local search are both more accurate and more efficient than the original NOTEARS.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。