Statistical relational frameworks such as Markov logic networks and probabilistic soft logic (PSL) encode model structure with weighted first-order logical clauses. Learning these clauses from data is referred to as structure learning. Structure learning alleviates the manual cost of specifying models. However, this benefit comes with high computational costs; structure learning typically requires an expensive search over the space of clauses which involves repeated optimization of clause weights. In this paper, we propose the first two approaches to structure learning for PSL. We introduce a greedy search-based algorithm and a novel optimization method that trade-off scalability and approximations to the structure learning problem in varying ways. The highly scalable optimization method combines data-driven generation of clauses with a piecewise pseudolikelihood (PPLL) objective that learns model structure by optimizing clause weights only once. We compare both methods across five real-world tasks, showing that PPLL achieves an order of magnitude runtime speedup and AUC gains up to 15% over greedy search.

本文提出了两种优化方法用于针对 PSL 的结构学习，一种是基于贪心搜索的算法，另一种是结合生成子句的数据驱动和针对性能的伪似然性段分段优化（PPLL）目标的算法， 在五个实际任务中的比较表明 PPLL 实现了数量级运行时加速和 AUC 增益高达 15％以上。

概率软逻辑的可扩展结构学习