arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1704.08783stat.MLcs.LG
收藏

通过OverDispersion评分(ODS)学习二次方差函数(QVF)DAG模型

Learning Quadratic Variance Function (QVF) DAG models via OverDispersion Scoring (ODS)

University of Michigan-Ann Arbor(密歇根大学安娜堡分校);University of Wisconsin-Madison(威斯康星大学麦迪逊分校)

Gunwoong Park, Garvesh Raskutti

摘要:

学习DAG或贝叶斯网络模型是多变量因果推断中的一个重要问题。然而,由于有向图空间巨大,在学习大规模DAG模型时出现了许多挑战,包括模型可识别性和计算复杂性。在本文中,我们解决了这些问题,在一个广泛的一类DAG模型的噪声或方差是信号相关的步骤。首先,我们介绍了一类新的可识别的DAG模型,其中每个节点具有方差是均值的二次函数的分布(QVF DAG模型)。我们的QVF DAG模型包括许多有趣的分布类别,如泊松分布、二项式分布、几何分布、指数分布、Gamma分布和许多其他噪声方差取决于均值的分布。我们证明了这类QVF DAG模型是可识别的,并介绍了一种新的算法,过度分散评分(ODS)算法,学习大规模QVF DAG模型。我们的算法是基于第一次学习道德化或无向图模型表示的DAG,以减少DAG搜索空间,然后利用二次方差属性学习因果排序。我们通过理论结果和模拟表明,我们的算法是统计上一致的,在高维p>n的设置提供的道德化图的程度是有界的,并表现良好相比,国家的最先进的DAG学习算法。

英文摘要:

Learning DAG or Bayesian network models is an important problem in multi-variate causal inference. However, a number of challenges arises in learning large-scale DAG models including model identifiability and computational complexity since the space of directed graphs is huge. In this paper, we address these issues in a number of steps for a broad class of DAG models where the noise or variance is signal-dependent. Firstly we introduce a new class of identifiable DAG models, where each node has a distribution where the variance is a quadratic function of the mean (QVF DAG models). Our QVF DAG models include many interesting classes of distributions such as Poisson, Binomial, Geometric, Exponential, Gamma and many other distributions in which the noise variance depends on the mean. We prove that this class of QVF DAG models is identifiable, and introduce a new algorithm, the OverDispersion Scoring (ODS) algorithm, for learning large-scale QVF DAG models. Our algorithm is based on firstly learning the moralized or undirected graphical model representation of the DAG to reduce the DAG search-space, and then exploiting the quadratic variance property to learn the causal ordering. We show through theoretical results and simulations that our algorithm is statistically consistent in the high-dimensional p>n setting provided that the degree of the moralized graph is bounded and performs well compared to state-of-the-art DAG-learning algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑