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

陈述性知识推理的软约束

Soft Constraints for Inference with Declarative Knowledge

MIT(麻省理工学院);UMass Amherst(马萨诸塞大学阿默斯特分校);Princeton University(普林斯顿大学);NYU(纽约大学)

Zenna Tavares, Javier Burroni, Edgar Minaysan, Armando Solar Lezama, Rajesh Ranganath

摘要:

我们开发了一个可能性的推理过程条件概率模型的谓词。一个谓词是一个布尔值函数,它表示一个关于域的是/否问题。我们的贡献,我们称之为谓词交换,构造了一个软化的谓词,它在单位区间[0,1]中取值,而不是简单的真或假。直觉上,1对应于真,并且高值(诸如0.999)对应于由距离度量确定的“接近真”。我们为软谓词定义了布尔代数,使得它们可以被任意否定、联合和分离。一个软化的谓词可以作为一个听话的代理近似后验推理的似然函数。然而,为了实现精确的推断,我们通过温度参数来调节松弛,并添加接受/拒绝阶段用于副本交换马尔可夫链蒙特卡罗,该模型在不同温度下以谓词为条件的一系列模型之间交换状态。我们描述了一个轻量级的实现谓词交换,它提供了一个语言独立的层,可以实现现有的建模形式。

英文摘要:

We develop a likelihood free inference procedure for conditioning a probabilistic model on a predicate. A predicate is a Boolean valued function which expresses a yes/no question about a domain. Our contribution, which we call predicate exchange, constructs a softened predicate which takes value in the unit interval [0, 1] as opposed to a simply true or false. Intuitively, 1 corresponds to true, and a high value (such as 0.999) corresponds to "nearly true" as determined by a distance metric. We define Boolean algebra for soft predicates, such that they can be negated, conjoined and disjoined arbitrarily. A softened predicate can serve as a tractable proxy to a likelihood function for approximate posterior inference. However, to target exact inference, we temper the relaxation by a temperature parameter, and add a accept/reject phase use to replica exchange Markov Chain Mont Carlo, which exchanges states between a sequence of models conditioned on predicates at varying temperatures. We describe a lightweight implementation of predicate exchange that it provides a language independent layer that can be implemented on top of existingn modeling formalisms.

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

↑