arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.04087cs.LGstat.ML
收藏

离散贝叶斯网络的多项式时间学习和样本复杂性

Learning discrete Bayesian networks in polynomial time and sample complexity

Purdue University(普渡大学)

Adarsh Barik, Jean Honorio

摘要:

本文研究了节点取值为离散值的贝叶斯网络的结构学习问题。这个问题是NP-困难的一般情况下,但我们表明,在一定条件下,我们可以恢复的真实结构的贝叶斯网络与足够数量的样本。我们开发了一个数学模型,它不假设任何特定的条件概率分布的节点。我们使用一个原始-对偶见证构造来证明,在节点对之间相互作用的某些技术条件下,我们可以通过执行组l_12-正则化多元回归来精确地恢复节点的父节点和子节点。这样,我们就恢复了真实的贝叶斯网络结构。如果一个节点的度是有界的,那么我们所提出的方法的样本复杂度相对于贝叶斯网络中的节点数呈几何增长。此外,我们的方法运行在多项式时间。

英文摘要:

In this paper, we study the problem of structure learning for Bayesian networks in which nodes take discrete values. The problem is NP-hard in general but we show that under certain conditions we can recover the true structure of a Bayesian network with sufficient number of samples. We develop a mathematical model which does not assume any specific conditional probability distributions for the nodes. We use a primal-dual witness construction to prove that, under some technical conditions on the interaction between node pairs, we can do exact recovery of the parents and children of a node by performing group l_12-regularized multivariate regression. Thus, we recover the true Bayesian network structure. If degree of a node is bounded then the sample complexity of our proposed approach grows logarithmically with respect to the number of nodes in the Bayesian network. Furthermore, our method runs in polynomial time.

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

↑