基于优化模理论的混合SRL
Hybrid SRL with Optimization Modulo Theories
摘要:
一般来说,构造性学习的目标可以被看作是,给定一组结构化对象的示例,生成具有相似属性的新对象。从关系学习(SRL)的角度来看,该任务可以被解释为一个约束满足问题,即生成的对象必须服从一组软约束,其权重从数据中估计。传统的SRL方法依赖于(有限)一阶逻辑(FOL)作为描述语言,并在MAX-SAT求解器上执行推理。唉,FOL是不适合建设性的问题,其中的对象包含布尔和数值变量的混合。事实上,在FOL语言中实现例如线性算术约束是困难的。在本文中,我们提出了一类新的混合SRL方法,依赖于可满足性模理论,一个替代类的形式语言,允许描述,并在混合布尔数值对象和约束的原因。由此产生的方法,我们称之为学习模型理论,制定了结构化输出SVM框架内,并采用加权SMT求解器作为优化预言执行有效的推理和歧视性的最大余量权重学习。我们还展示了一些通过我们的方法实现的建设性学习应用程序的示例。
英文摘要:
Generally speaking, the goal of constructive learning could be seen as, given an example set of structured objects, to generate novel objects with similar properties. From a statistical-relational learning (SRL) viewpoint, the task can be interpreted as a constraint satisfaction problem, i.e. the generated objects must obey a set of soft constraints, whose weights are estimated from the data. Traditional SRL approaches rely on (finite) First-Order Logic (FOL) as a description language, and on MAX-SAT solvers to perform inference. Alas, FOL is unsuited for con- structive problems where the objects contain a mixture of Boolean and numerical variables. It is in fact difficult to implement, e.g. linear arithmetic constraints within the language of FOL. In this paper we propose a novel class of hybrid SRL methods that rely on Satisfiability Modulo Theories, an alternative class of for- mal languages that allow to describe, and reason over, mixed Boolean-numerical objects and constraints. The resulting methods, which we call Learning Mod- ulo Theories, are formulated within the structured output SVM framework, and employ a weighted SMT solver as an optimization oracle to perform efficient in- ference and discriminative max margin weight learning. We also present a few examples of constructive learning applications enabled by our method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。