arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/9408101cs.AI
收藏

随机世界与最大熵

Random Worlds and Maximum Entropy

A. J. Grove, J. Y. Halpern, D. Koller

摘要:

给定一个知识库KB包含一阶和统计事实,我们考虑一个原则性的方法,称为随机世界的方法,用于计算一定程度的信念,一些公式φ持有给定KB。如果我们正在推理一个由N个个体组成的世界或系统,那么我们可以考虑所有可能的世界,或一阶模型,域为{1,.,N},并计算其中Phi为真的分数。我们将置信度定义为N变大时该分数的渐近值。我们表明,当Phi和KB的词汇表只使用常数和一元谓词时,我们可以自然地将熵与每个世界联系起来。随着N变大,有更多的世界具有更高的熵。因此,我们可以使用最大熵计算来计算置信度。这一结果与物理学和人工智能以前的工作类似,但更为普遍。与结果本身同样重要的是其范围的限制。最重要的是,对一元谓词的限制似乎是必要的。虽然随机世界方法在一般情况下是有意义的,但在非一元情况下,与最大熵的联系似乎消失了。这些观察结果表明,最大熵方法的适用性意想不到的限制。

英文摘要:

Given a knowledge base KB containing first-order and statistical facts, we consider a principled method, called the random-worlds method, for computing a degree of belief that some formula Phi holds given KB. If we are reasoning about a world or system consisting of N individuals, then we can consider all possible worlds, or first-order models, with domain {1,...,N} that satisfy KB, and compute the fraction of them in which Phi is true. We define the degree of belief to be the asymptotic value of this fraction as N grows large. We show that when the vocabulary underlying Phi and KB uses constants and unary predicates only, we can naturally associate an entropy with each world. As N grows larger, there are many more worlds with higher entropy. Therefore, we can use a maximum-entropy computation to compute the degree of belief. This result is in a similar spirit to previous work in physics and artificial intelligence, but is far more general. Of equal interest to the result itself are the limitations on its scope. Most importantly, the restriction to unary predicates seems necessary. Although the random-worlds method makes sense in general, the connection to maximum entropy seems to disappear in the non-unary case. These observations suggest unexpected limitations to the applicability of maximum-entropy methods.

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

↑