arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1106.1797cs.AI
收藏

符号统计建模中逻辑程序的参数学习

Parameter Learning of Logic Programs for Symbolic-Statistical Modeling

Tokyo Institute of Technology(东京工业大学)

T. Sato, Y. Kameya

摘要:

我们提出了一个逻辑/数学框架的统计参数学习的参数化逻辑程序,即含有概率事实的定子句程序与参数化分布。它将逻辑程序设计中传统的最小Herbrand模型语义扩展到分布语义,即具有概率分布的可能世界语义,这种概率分布无条件地适用于任意逻辑程序,包括HSPG、PCFG和Bayesian网络。我们还提出了一个新的EM算法,图形EM算法,运行一类参数化的逻辑程序表示顺序决策过程中,每个决定是排他性和独立的。它运行在一个新的数据结构上,称为支持图,描述观察和它们的解释之间的逻辑关系,并通过计算逻辑程序的内部和外部概率来学习参数。复杂度分析表明,当结合OLDT搜索所有观测解释时,图形EM算法尽管具有一般性,但其时间复杂度与已有EM算法相同,即针对Hacker的Baum-Welch算法、针对PCFG的Inside-Outside算法以及针对单连接贝叶斯网络的算法,这些算法在各个研究领域都是独立发展的。使用两个中等大小的语料库的PCFG的学习实验表明,图形EM算法可以显着优于内-外算法。

英文摘要:

We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. definite clause programs containing probabilistic facts with a parameterized distribution. It extends the traditional least Herbrand model semantics in logic programming to distribution semantics, possible world semantics with a probability distribution which is unconditionally applicable to arbitrary logic programs including ones for HMMs, PCFGs and Bayesian networks. We also propose a new EM algorithm, the graphical EM algorithm, that runs for a class of parameterized logic programs representing sequential decision processes where each decision is exclusive and independent. It runs on a new data structure called support graphs describing the logical relationship between observations and their explanations, and learns parameters by computing inside and outside probability generalized for logic programs. The complexity analysis shows that when combined with OLDT search for all explanations for observations, the graphical EM algorithm, despite its generality, has the same time complexity as existing EM algorithms, i.e. the Baum-Welch algorithm for HMMs, the Inside-Outside algorithm for PCFGs, and the one for singly connected Bayesian networks that have been developed independently in each research field. Learning experiments with PCFGs using two corpora of moderate size indicate that the graphical EM algorithm can significantly outperform the Inside-Outside algorithm.

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

↑