和积网络参数学习的统一方法
A Unified Approach for Learning the Parameters of Sum-Product Networks
摘要:
本文提出了一种学习和积网络参数的统一方法。我们证明了任何完整的和可分解的SPN是相当于一个混合的树,其中每棵树对应于一个产品的单变量分布。基于混合模型的角度来看,我们的目标函数的特点,学习SPN的最大似然估计(MLE)原则的基础上,并表明,优化问题可以制定为一个符号程序。我们构造了两个参数学习算法的SPN分别使用顺序单项逼近(SMA)和凹凸过程(CCCP)。这两种方法自然地允许乘法更新,从而有效地避免了投影操作。在统一框架的帮助下,我们还表明,在SPN的情况下,CCCP导致相同的算法的期望最大化(EM),尽管事实上,他们是不同的一般。
英文摘要:
We present a unified approach for learning the parameters of Sum-Product networks (SPNs). We prove that any complete and decomposable SPN is equivalent to a mixture of trees where each tree corresponds to a product of univariate distributions. Based on the mixture model perspective, we characterize the objective function when learning SPNs based on the maximum likelihood estimation (MLE) principle and show that the optimization problem can be formulated as a signomial program. We construct two parameter learning algorithms for SPNs by using sequential monomial approximations (SMA) and the concave-convex procedure (CCCP), respectively. The two proposed methods naturally admit multiplicative updates, hence effectively avoiding the projection operation. With the help of the unified framework, we also show that, in the case of SPNs, CCCP leads to the same algorithm as Expectation Maximization (EM) despite the fact that they are different in general.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。