多项式时间内因子图的学习&样本复杂度
Learning Factor Graphs in Polynomial Time & Sample Complexity
摘要:
我们研究了图模型中参数和结构学习的计算和样本复杂性。我们的主要结果表明,一类具有有限因子大小和有限连通度的因子图可以在多项式时间和多项式样本数内学习,假设数据是由该类网络生成的。该结果涵盖了已知网络结构的参数估计和结构学习。这意味着作为一个推论,我们可以学习因子图的贝叶斯网络和马尔可夫网络的有界度,在多项式时间和样本复杂性。与最大似然估计不同,我们的方法不需要在底层网络中进行推理,因此适用于推理难以处理的网络。我们还表明,当生成的分布不是目标网络类的成员时,我们的学习模型的误差会优雅地降低。
英文摘要:
We study computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded factor size and bounded connectivity can be learned in polynomial time and polynomial number of samples, assuming that the data is generated by a network in this class. This result covers both parameter estimation for a known network structure and structure learning. It implies as a corollary that we can learn factor graphs for both Bayesian networks and Markov networks of bounded degree, in polynomial time and sample complexity. Unlike maximum likelihood estimation, our method does not require inference in the underlying network, and so applies to networks where inference is intractable. We also show that the error of our learned model degrades gracefully when the generating distribution is not a member of the target class of networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。